Nowhere-zero 4-flow in almost Petersen-minor free graphs

DOI10.1016/J.DISC.2007.11.055zbMath1168.05054OpenAlexW2005014466MaRDI QIDQ1011772

Cun-Quan Zhang, Xiao-Feng Wang, Taoye Zhang

Publication date: 9 April 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.055

zbMATH Keywords

Petersen minorinteger flow4-flowalmost Petersen-minor free graphsedge-3-colouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Related Items (2)

The complexity of the zero-sum 3-flows ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The four-colour theorem
• Tutte's edge-colouring conjecture
• Excluding Minors in Nonplanar Graphs of Girth at Least Five
• Double cycle covers and the petersen graph
• On the chromatic number of binary matroids
• Every Planar Map is Four Colorable
• Nowhere zero 4‐flow in regular matroids
• On the algebraic theory of graph colorings

This page was built for publication: Nowhere-zero 4-flow in almost Petersen-minor free graphs