Nowhere-zero 4-flows and cycle double covers

DOI10.1016/0012-365X(95)00047-ZzbMath0853.05064MaRDI QIDQ1918555

Cun-Quan Zhang

Publication date: 22 August 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cyclecycle double cover conjecturebridgeless graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Flow modules and nowhere-zero flows ⋮ The complexity of the zero-sum 3-flows ⋮ Cycle double covers and spanning minors. I ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications ⋮ Strong 5-cycle double covers of graphs

Cites Work

• Cycle covers of cubic multigraphs
• Semi-duality and the cycle double cover conjecture
• Cycle double covers of graphs with Hamilton paths
• Flows and generalized coloring theorems in graphs
• Nowhere-zero 3-flows of highly connected graphs
• On circuit decomposition of planar Eulerian graphs
• Five cycle double covers of some cubic graphs
• Face colorings of embedded graphs
• Minimum cycle coverings and integer flows
• Integer flows
• Graphs with the Circuit Cover Property
• On the algebraic theory of graph colorings
• Polyhedral decompositions of cubic graphs
• A Contribution to the Theory of Chromatic Polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nowhere-zero 4-flows and cycle double covers