Graphs with the Circuit Cover Property

DOI10.2307/2154711zbMath0810.05043OpenAlexW4232166065MaRDI QIDQ4305925

Cun-Quan Zhang, Brian Alspach, Luis A. Goddyn

Publication date: 15 September 1994

Full work available at URL: https://doi.org/10.2307/2154711

zbMATH Keywords

cycle double coveredge-weighted graphmultisetedge-cutPetersen's graphcircuit covercircuit cover property

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (29)

Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights. ⋮ Shortest circuit covers of signed graphs ⋮ On even circuit decompositions of eulerian graphs ⋮ The construction and reduction of strong snarks ⋮ Circuit Covers of Signed Graphs ⋮ Hilbert bases of cuts ⋮ Nowhere-zero 4-flows and cycle double covers ⋮ Removable circuits in multigraphs ⋮ Circuit extension and circuit double cover of graphs ⋮ Cycle double covers and the semi-Kotzig frame ⋮ On Hilbert bases of cuts ⋮ Orientable embeddings and orientable cycle double covers of projective-planar graphs ⋮ On covers of graphs ⋮ Reducible configurations for the cycle double cover conjecture ⋮ Generation and properties of snarks ⋮ The extremal function for Petersen minors ⋮ Cycle covers of cubic multigraphs ⋮ Postman tours and cycle covers ⋮ A bound on the total size of a cut cover ⋮ Cycle covers (I) - minimal contra pairs and Hamilton weights ⋮ Box-total dual integrality, box-integrality, and equimodular matrices ⋮ On circuit decomposition of planar Eulerian graphs ⋮ Triangle-free circuit decompositions and Petersen minor ⋮ Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor ⋮ Proofs of two minimum circuit cover conjectures ⋮ Circuit decompositions of Eulerian graphs ⋮ Brian Alspach and his work ⋮ Circuit Double Covers of Graphs ⋮ A note about shortest cycle covers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycle covers of cubic multigraphs
• Covering weighted graphs by even subgraphs
• Shortest coverings of graphs with cycles
• Nowhere zero flow and circuit covering in regular matroids
• An integer analogue of Carathéodory's theorem
• Semi-duality and the cycle double cover conjecture
• Cycle double covers of graphs with Hamilton paths
• Short circuit covers for regular matroids with a nowhere zero 5-flow
• Flows and generalized coloring theorems in graphs
• Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
• Matroids and multicommodity flows
• Even circuits in planar graphs
• Integer flows and cycle covers
• Short cycle covers and the cycle double cover conjecture
• Matroids with the circuit cover property
• On circuit decomposition of planar Eulerian graphs
• Graph minors. XIII: The disjoint paths problem
• Double cycle covers and the petersen graph
• Face colorings of embedded graphs
• Minimum cycle coverings and integer flows
• Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
• Integer flows
• Covering Multigraphs by Simple Circuits
• Loops in Duals
• On the eulericity of a graph
• Matching, Euler tours and the Chinese postman
• Polyhedral decompositions of cubic graphs
• Blocking and anti-blocking pairs of polyhedra
• On the Imbedding of Linear Graphs in Surfaces

This page was built for publication: Graphs with the Circuit Cover Property