Graphs with the Circuit Cover Property
From MaRDI portal
Publication:4305925
DOI10.2307/2154711zbMath0810.05043MaRDI 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
cycle double cover; edge-weighted graph; multiset; edge-cut; Petersen's graph; circuit cover; circuit cover property
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C75: Structural characterization of families of graphs
Related Items
On even circuit decompositions of eulerian graphs, Cycle covers of cubic multigraphs, Postman tours and cycle covers, Cycle covers (I) - minimal contra pairs and Hamilton weights, Triangle-free circuit decompositions and Petersen minor, The construction and reduction of strong snarks, Removable circuits in multigraphs, On covers of graphs, Proofs of two minimum circuit cover conjectures, Circuit decompositions of Eulerian graphs, On circuit decomposition of planar Eulerian graphs, Hilbert bases of cuts, Nowhere-zero 4-flows and cycle double covers, Reducible configurations for the cycle double cover conjecture, Orientable embeddings and orientable cycle double covers of projective-planar graphs, A bound on the total size of a cut cover, Brian Alspach and his work, 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
