Circuit double covers of graphs
From MaRDI portal
Recommendations
Cites work
- A Contribution to the Theory of Chromatic Polynomials
- Blocking and anti-blocking pairs of polyhedra
- Circuit double cover of graphs
- Circuit double covers in special types of cubic graphs
- Classes of line graphs with small cycle double covers
- Closed 2-cell embeddings of 4 cross-cap embeddable graphs
- Closed 2-cell embeddings of 5-crosscap embeddable graphs
- Covering Graphs by Cycles
- Cycle covers of cubic multigraphs
- Cycle double covers and spanning minors. I
- Cycle double covers and the semi-Kotzig frame
- Cycle double covers of graphs with Hamilton paths
- Double covers of cubic graphs with oddness 4
- Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
- Face colorings of embedded graphs
- Five cycle double covers of some cubic graphs
- Flows and generalized coloring theorems in graphs
- Generation and properties of snarks
- Graph theory
- Graphs with the Circuit Cover Property
- Hajós' conjecture and small cycle double covers of planar graphs
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- scientific article; zbMATH DE number 446493 (Why is no real title available?)
- scientific article; zbMATH DE number 3885954 (Why is no real title available?)
- scientific article; zbMATH DE number 3851137 (Why is no real title available?)
- scientific article; zbMATH DE number 4214053 (Why is no real title available?)
- scientific article; zbMATH DE number 3937198 (Why is no real title available?)
- scientific article; zbMATH DE number 140148 (Why is no real title available?)
- scientific article; zbMATH DE number 3600081 (Why is no real title available?)
- scientific article; zbMATH DE number 3639661 (Why is no real title available?)
- scientific article; zbMATH DE number 475604 (Why is no real title available?)
- scientific article; zbMATH DE number 863473 (Why is no real title available?)
- Kotzig frames and circuit double covers
- Line graphs of complete multipartite graphs have small cycle double covers
- Maximal planar graphs of diameter two
- Nowhere-zero 6-flows
- On cycle-double covers of graphs of small oddness
- On semiextensions and circuit double covers
- On the eulericity of a graph
- On the Imbedding of Linear Graphs in Surfaces
- Polyhedral decompositions of cubic graphs
- Proof of the strong 2-cover conjecture for planar graphs
- Reducible configurations for the cycle double cover conjecture
- Semi-duality and the cycle double cover conjecture
- Shortest coverings of graphs with cycles
- Small circuit double covers of cubic multigraphs
- Small cycle double covers of 4-connected planar graphs
- Small cycle double covers of products I: Lexicographic product with paths and cycles
- Small cycle double covers of products. II: Categorical and strong products with paths and cycles
- Snarks without small cycles
- Stable dominating circuits in snarks
- Strong circuit double cover of some cubic graphs
- Strong embeddings of minimum genus
- The closed 2-cell embeddings of 2-connected doubly toroidal graphs
- The NP-Completeness of Edge-Coloring
- Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
Cited in
(16)- Circle graphs and the cycle double cover conjecture
- Small circuit double covers of cubic multigraphs
- On covers of graphs
- Typical circulant double coverings of a circulant graph.
- An overview of graph covering and partitioning
- A note on the circuit double cover of infinite graphs
- Circuit double cover of graphs
- Strong circuit double cover of some cubic graphs
- scientific article; zbMATH DE number 3937197 (Why is no real title available?)
- Circuit extension and circuit double cover of graphs
- scientific article; zbMATH DE number 1779394 (Why is no real title available?)
- scientific article; zbMATH DE number 1790882 (Why is no real title available?)
- 5-Cycle Double Covers, 4-Flows, and Catlin Reduction
- Kotzig frames and circuit double covers
- How many conjectures can you stand? A survey
- Counting circuit double covers
This page was built for publication: Circuit double covers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5506787)
