Related papers: Delta-confluent Drawings
A graph with a semiregular group of automorphisms can be thought of as the derived cover arising from a voltage graph. Since its inception, the theory of voltage graphs and their derived covers has been a powerful tool used in the study of…
A directed hypergraph (dihypergraph) consists of a set of vertices and a set of hyperarcs, where each hyperarc is partitioned into a head and a tail. Directed hypergraphs are useful in many applications, including the study of chemical…
In this paper we explore mathematical tools that can be used to relate directed and undirected random graph models to each other. We identify probability spaces on which a directed and an undirected graph model are equivalent, and…
A vertex with neighbours of degrees $d_1 \geq ... \geq d_r$ has {\em vertex type} $(d_1, ..., d_r)$. A graph is {\em vertex-oblique} if each vertex has a distinct vertex-type. While no graph can have distinct degrees, Schreyer, Walther and…
To most mathematicians and computer scientists the word ``tree'' conjures up, in addition to the usual image, the image of a connected graph with no circuits. In the last few years various types of trees have been the subject of much…
Symmetry is a key feature observed in nature (from flowers and leaves, to butterflies and birds) and in human-made objects (from paintings and sculptures, to manufactured objects and architectural design). Rotational, translational, and…
Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…
We introduce tabular algebras, which are simultaneous generalizations of cellular algebras (in the sense of Graham-Lehrer) and table algebras (in the sense of Arad-Blau). We show that if a tabular algebra is equipped with a certain kind of…
We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call "extender" and "hypershallow" graph sequences, respectively. Our main result is a probabilistic…
We investigate a new width parameter, the fusion-width of a graph. It is a natural generalization of the tree-width, yet strong enough that not only graphs of bounded tree-width, but also graphs of bounded clique-width, trivially have…
The Gallai graph $\Gamma(G)$ of a graph $G$ has the edges of $G$ as its vertices and two distinct vertices $e$ and $f$ of $\Gamma(G)$ are adjacent in $\Gamma(G)$ if the edges $e$ and $f$ of $G$ are adjacent in $G$ but do not span a triangle…
Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…
As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
We propose and study a hierarchical algorithm to generate graphs having a predetermined distribution of cliques, the fully connected subgraphs. The construction mechanism may be either random or incorporate preferential attachment. We…
In evolutionary biology, phylogenetic networks are graphs that provide a flexible framework for representing complex evolutionary histories that involve reticulate evolutionary events. Recently phylogenetic studies have started to focus on…
In this article, we use a unified approach to prove several classes of planar graphs are DP-$3$-colorable, which extend the corresponding results on $3$-choosability.
The families of graphs defined by a certain type of system of equations over commutative rings have been studied and used since 1990s. This survey presents these families and their applications related to graphs, digraphs, and hypergraphs.…
Cographs--defined most simply as complete graphs with colored lines--both dualize and generalize ordinary graphs, and promise a comparably wide range of applications. This article introduces them by examples, catalogues, and elementary…