Circuit Double Covers of Graphs
From MaRDI portal
Publication:5506787
DOI10.1007/978-3-319-31940-7_16zbMath1352.05155OpenAlexW370382812MaRDI QIDQ5506787
Publication date: 16 December 2016
Published in: Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-31940-7_16
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycle double covers and the semi-Kotzig frame
- Generation and properties of snarks
- Kotzig frames and circuit double covers
- Cycle covers of cubic multigraphs
- Strong embeddings of minimum genus
- Shortest coverings of graphs with cycles
- On semiextensions and circuit double covers
- Small cycle double covers of products. II: Categorical and strong products with paths and cycles
- Circuit double covers in special types of cubic graphs
- Proof of the strong 2-cover conjecture for planar graphs
- Semi-duality and the cycle double cover conjecture
- Cycle double covers of graphs with Hamilton paths
- Flows and generalized coloring theorems in graphs
- Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
- Nowhere-zero 6-flows
- Hajós' conjecture and small cycle double covers of planar graphs
- Small cycle double covers of 4-connected planar graphs
- Small circuit double covers of cubic multigraphs
- Closed 2-cell embeddings of 4 cross-cap embeddable graphs
- Closed 2-cell embeddings of 5-crosscap embeddable graphs
- Double covers of cubic graphs with oddness 4
- Line graphs of complete multipartite graphs have small cycle double covers
- Five cycle double covers of some cubic graphs
- The closed 2-cell embeddings of 2-connected doubly toroidal graphs
- Snarks without small cycles
- Reducible configurations for the cycle double cover conjecture
- Cycle double covers and spanning minors. I
- Circuit Double Cover of Graphs
- Strong Circuit Double Cover of Some Cubic Graphs
- Face colorings of embedded graphs
- Maximal planar graphs of diameter two
- The NP-Completeness of Edge-Coloring
- Covering Graphs by Cycles
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- On the eulericity of a graph
- Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
- Graphs with the Circuit Cover Property
- Small cycle double covers of products I: Lexicographic product with paths and cycles
- Polyhedral decompositions of cubic graphs
- Blocking and anti-blocking pairs of polyhedra
- On the Imbedding of Linear Graphs in Surfaces
- A Contribution to the Theory of Chromatic Polynomials
- On cycle-double covers of graphs of small oddness
- Stable dominating circuits in snarks
This page was built for publication: Circuit Double Covers of Graphs
