Integer flows and cycle covers

DOI10.1016/0095-8956(92)90069-AzbMath0776.05084MaRDI QIDQ1186130

Geng-Hua Fan

Publication date: 28 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

bridgeless graphcoverspanning treesinteger flowscycle covers

Mathematics Subject Classification ID

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

Related Items (12)

Cycle covers of graphs with a nowhere-zero 4-flow ⋮ Decomposition of the flow polynomial ⋮ Smallest (1, 2)‐eulerian weight and shortest cycle covering ⋮ Circuit \(k\)-covers of signed graphs ⋮ Three-matching intersection conjecture for perfect matching polytopes of small dimensions ⋮ Circuit covers of signed Eulerian graphs ⋮ Circuit decompositions and shortest circuit coverings of hypergraphs ⋮ Graphs with the Circuit Cover Property ⋮ Minimum cycle coverings and integer flows ⋮ Spectral threshold for extremal cyclic edge-connectivity ⋮ A note about shortest cycle covers ⋮ Fulkerson-covers of hypohamiltonian graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering weighted graphs by even subgraphs
• Shortest coverings of graphs with cycles
• Cycle covering in bridgeless graphs
• Flows and generalized coloring theorems in graphs
• Nowhere-zero 6-flows
• A Class Of Abelian Groups
• Integer flows
• Covering Multigraphs by Simple Circuits
• A Note on Sub-Eulerian Graphs
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Maximum matching and a polyhedron with 0,1-vertices
• Polyhedral decompositions of cubic graphs
• Blocking and anti-blocking pairs of polyhedra
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Integer flows and cycle covers