Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts

DOI10.1016/j.ejc.2013.05.016zbMath1284.05104OpenAlexW2019350858MaRDI QIDQ2441610

Cun-Quan Zhang, Rong Luo, Rui Xu, Zheng-Ke Miao

Publication date: 25 March 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2013.05.016

zbMATH Keywords

chromatic numberodd-cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (2)

Nowhere-zero 3-flows of graphs with independence number two ⋮ Coloring drawings of graphs

Cites Work

• Colourings of graphs with two consecutive odd cycle lengths
• Graphs with \(k\) odd cycle lengths
• Circular flows of nearly Eulerian graphs and vertex-splitting
• Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable
• Structure and Coloring of Graphs with Only Small Odd Cycles
• Ore Condition and Nowhere-Zero 3-Flows
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts