Extensions of flow theorems

DOI10.1006/jctb.1997.1727zbMath0873.05059OpenAlexW2070647236MaRDI QIDQ1354719

Geng-Hua Fan

Publication date: 26 October 1997

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

Full work available at URL: https://doi.org/10.1006/jctb.1997.1727

zbMATH Keywords

flow theoremsshort cycle cover

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items

Proofs of two minimum circuit cover conjectures, Fulkerson-covers of hypohamiltonian graphs

Cites Work

• Unnamed Item
• Shortest coverings of graphs with cycles
• Cycle covering in bridgeless graphs
• Flows and generalized coloring theorems in graphs
• Nowhere-zero 6-flows
• Unsolved problems presented at the Julius Petersen graph theory conference
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Circuit coverings of graphs and a conjecture of Pyber
• Double cycle covers and the petersen graph
• A Class Of Abelian Groups
• Integer flows
• Covering Multigraphs by Simple Circuits
• Covering Graphs by Simple Circuits
• Covering Graphs by Cycles
• On the algebraic theory of graph colorings
• A Contribution to the Theory of Chromatic Polynomials