AbstractA closed 2-cell embedding of a graph embedded in some surface is an embedding such that each face is bounded by a cycle in the graph. The strong embedding conjecture says that every 2-connected graph has a closed 2-cell embedding in some surface. In this paper, we prove that any 2-connected graph without V8 (the Möbius 4-ladder) as a minor has a closed 2-cell embedding in some surface. As a corollary, such a graph has a cycle double cover. The proof uses a classification of internally-4-connected graphs with no V8-minor (due to Kelmans and independently Robertson), and the proof depends heavily on such a characterization
AbstractFor a finite connected simple graph G, let Γ be a group of graph automorphisms of G. Two 2-c...
AbstractEvery 2-connected simple cubic graph of order n⩾6 has a cycle cover with at most ⌈n/4⌉ cycle...
AbstractLet G and H be finite graphs with equal uniform degree refinements. Their finite common cove...
AbstractA closed 2-cell embedding of a graph embedded in some surface is an embedding such that each...
AbstractA closed 2-cell embedding of a graph embedded in some surface is an embedding such that each...
AbstractA closed 2-cell embedding of a graph embedded in some surface is an embedding such that each...
AbstractIn a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bou...
AbstractA closed 2-cell embedding of a graph embedded in some surface is an embedding such that each...
AbstractThe strong embedding conjecture states that every 2-connected graph has a closed 2-cell embe...
AbstractThe cycle double cover conjecture is equivalent to the ‘pseudosurface embedding conjecture’ ...
AbstractA closed 2-cell embedding of a graph embedded in some surface is an embedding such that each...
AbstractIn a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bou...
AbstractDefine a graph to be a Kotzig graph if it is m-regular and has an m-edge colouring in which ...
AbstractWe investigate embeddings of graphs on orientable 2-dimensional surfaces such that all face ...
We determine the excluded minors characterising the class of countable graphs that embed into some c...
AbstractFor a finite connected simple graph G, let Γ be a group of graph automorphisms of G. Two 2-c...
AbstractEvery 2-connected simple cubic graph of order n⩾6 has a cycle cover with at most ⌈n/4⌉ cycle...
AbstractLet G and H be finite graphs with equal uniform degree refinements. Their finite common cove...
AbstractA closed 2-cell embedding of a graph embedded in some surface is an embedding such that each...
AbstractA closed 2-cell embedding of a graph embedded in some surface is an embedding such that each...
AbstractA closed 2-cell embedding of a graph embedded in some surface is an embedding such that each...
AbstractIn a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bou...
AbstractA closed 2-cell embedding of a graph embedded in some surface is an embedding such that each...
AbstractThe strong embedding conjecture states that every 2-connected graph has a closed 2-cell embe...
AbstractThe cycle double cover conjecture is equivalent to the ‘pseudosurface embedding conjecture’ ...
AbstractA closed 2-cell embedding of a graph embedded in some surface is an embedding such that each...
AbstractIn a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bou...
AbstractDefine a graph to be a Kotzig graph if it is m-regular and has an m-edge colouring in which ...
AbstractWe investigate embeddings of graphs on orientable 2-dimensional surfaces such that all face ...
We determine the excluded minors characterising the class of countable graphs that embed into some c...
AbstractFor a finite connected simple graph G, let Γ be a group of graph automorphisms of G. Two 2-c...
AbstractEvery 2-connected simple cubic graph of order n⩾6 has a cycle cover with at most ⌈n/4⌉ cycle...
AbstractLet G and H be finite graphs with equal uniform degree refinements. Their finite common cove...