Related papers: Eulerian properties of hypergraphs
A graph $G$ is said to be a `set graph' if it admits an acyclic orientation that is also `extensional', in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the…
An \emph{s-graph} is a graph with two kinds of edges: \emph{subdivisible} edges and \emph{real} edges. A \emph{realisation} of an s-graph $B$ is any graph obtained by subdividing subdivisible edges of $B$ into paths of arbitrary length (at…
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has been extensively studied, due to both its interesting structure…
Given a graph $Y$ on $n$ vertices and a desired level of fault-tolerance $k$, an objective in fault-tolerant system design is to construct a supergraph $X$ on $n + k$ vertices such that the removal of any $k$ nodes from $X$ leaves a graph…
The celebrated Erd\H{o}s-P\'{o}sa Theorem, in one formulation, asserts that for every $c\geq 1$, graphs with no subgraph (or equivalently, minor) isomorphic to the disjoint union of $c$ cycles have bounded treewidth. What can we say about…
The Erd\H{o}s, Gr\"unwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this article we prove an effective version of the Erd\H{o}s,…
A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H…
Gao and Richter (1994) showed that every $3$-connected graph which embeds on the plane or the projective plane has a spanning closed walk meeting each vertex at most $2$ times. Brunet, Ellingham, Gao, Metzlar, and Richter (1995) extended…
A graph is edge-transitive if the natural action of its automorphism group on its edge set is transitive. An automorphism of a graph is semiregular if all of the orbits of the subgroup generated by this automorphism have the same length.…
We study the following generalization of the Hamiltonian cycle problem: Given integers $a,b$ and graph $G$, does there exist a closed walk in $G$ that visits every vertex at least $a$ times and at most $b$ times? Equivalently, does there…
What are the unavoidable induced subgraphs of graphs with large treewidth? It is well-known that the answer must include a complete graph, a complete bipartite graph, all subdivisions of a wall and line graphs of all subdivisions of a wall…
The Second Neighborhood Conjecture states that every simple digraph has a vertex whose second out-neighborhood is at least as large as its first out-neighborhood, i.e. a vertex with the Second Neighborhood Property. A cycle intersection…
We provide a generating function for the (graded) dimensions of M. Kontsevich's graph complexes of ordinary graphs. This generating function can be used to compute the Euler characteristic in each loop order. Furthermore, we show that…
Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks…
We prove that for every surface $\Sigma$, the class of Eulerian directed graphs that are Eulerian embeddable into $\Sigma$ (in particular they have degree at most $4$) is well-quasi-ordered by strong immersion. This result marks one of the…
In the present paper we give an explicit formula which allows us immediately to describe a unique Gauss circuit on a framed 4-valent graph (a graph with a structure of opposite edges) from an arbitrary Euler tour on the graph whenever the…
A Helly circular-arc graph is the intersection graph of a set of arcs on a circle having the Helly property. We introduce essential obstacles, which are a refinement of the notion of obstacles, and prove that essential obstacles are…
A graph $G$ is called an $L_1$-graph if $d(u)+d(v)\ge|N(u)\cup N(v)\cup N(w)|-1$ for every triple of vertices $u,v,w$ where $u$ and $v$ are at distance 2 and $w\in N(u)\cap N(v)$. Asratian et al. (1996) proved that all finite connected…
Matrix-based centrality measures have enjoyed significant popularity in network analysis, in no small part due to our ability to rigorously analyze their behavior as parameters vary. Recent work has considered the relationship between…
An Eulerian-minor of an Eulerian graph is obtained from an Eulerian subgraph of the Eulerian graph by contraction. The Eulerian-minor operation preserves Eulerian properties of graphs and moreover Eulerian graphs are well-quasi-ordered…