Integer flows and cycle covers

DOI10.1016/0095-8956(92)90069-AMaRDI QIDQ1186130zbMATH OpenFDO

Authors Genghua Fan

Publication date 28 June 1992

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

zbMATH Keywords

spanning treescoverbridgeless graphinteger flowscycle covers

Mathematics Subject Classification ID

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

Recommendations

• Minimum cycle coverings and integer flows
• Cycle covering in bridgeless graphs
• Flows, flow-pair covers and cycle double covers
• Cycle covers of graphs with a nowhere-zero 4-flow
• Integer 4-flows and cycle covers

Cites work

• scientific article; zbMATH DE number 3966112 (Why is no real title available?)
• scientific article; zbMATH DE number 3728302 (Why is no real title available?)
• scientific article; zbMATH DE number 3508211 (Why is no real title available?)
• scientific article; zbMATH DE number 3600081 (Why is no real title available?)
• A Class Of Abelian Groups
• A Contribution to the Theory of Chromatic Polynomials
• A Note on Sub-Eulerian Graphs
• Blocking and anti-blocking pairs of polyhedra
• Covering Multigraphs by Simple Circuits
• Covering weighted graphs by even subgraphs
• Cycle covering in bridgeless graphs
• Flows and generalized coloring theorems in graphs
• Integer flows
• Maximum matching and a polyhedron with 0,1-vertices
• Nowhere-zero 6-flows
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Polyhedral decompositions of cubic graphs
• Shortest coverings of graphs with cycles

Cited in

(20)

• Smallest (1, 2)‐eulerian weight and shortest cycle covering
• Integer flows and subgraph covers
• Fulkerson-covers of hypohamiltonian graphs
• Circuit decompositions and shortest circuit coverings of hypergraphs
• Three-matching intersection conjecture for perfect matching polytopes of small dimensions
• A note about shortest cycle covers
• Double cycle covers and the petersen graph
• Integer equal flows
• Cycles Intersecting Edge-Cuts of Prescribed Sizes
• Flows, flow-pair covers and cycle double covers
• Spectral threshold for extremal cyclic edge-connectivity
• Minimum cycle coverings and integer flows
• scientific article; zbMATH DE number 4061294 (Why is no real title available?)
• Graphs with the Circuit Cover Property
• Cycle covers of graphs with a nowhere-zero 4-flow
• Circuit covers of signed Eulerian graphs
• Integer 4-flows and cycle covers
• Decomposition of the flow polynomial
• scientific article; zbMATH DE number 4177081 (Why is no real title available?)
• Circuit \(k\)-covers of signed graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186130)