Integer 4-flows and cycle covers

DOI10.1007/s00493-016-3379-9zbMath1399.05180OpenAlexW2563294730MaRDI QIDQ1743175

Geng-Hua Fan

Publication date: 12 April 2018

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-016-3379-9

zbMATH Keywords

cycle covers

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (5)

Minimum $T$-Joins and Signed-Circuit Covering ⋮ Short cycle covers of graphs with at most 77\% vertices of degree two ⋮ Cubic Graphs with No Short Cycle Covers ⋮ Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits ⋮ Note on integer 4-flows in graphs

Cites Work

• Covering weighted graphs by even subgraphs
• Shortest coverings of graphs with cycles
• Short circuit covers for regular matroids with a nowhere zero 5-flow
• Flows and generalized coloring theorems in graphs
• On Tutte's extension of the four-colour problem
• Nowhere-zero 6-flows
• Short cycle covers and the cycle double cover conjecture
• Shortest circuit covers of cubic graphs
• Fulkerson's conjecture and circuit covers
• Short Cycle Covers of Graphs with Minimum Degree Three
• Double cycle covers and the petersen graph
• Covering Multigraphs by Simple Circuits
• Short cycle covers of cubic graphs
• Polyhedral decompositions of cubic graphs

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