A dual version of the brooks group coloring theorem

DOI10.1016/j.disc.2012.03.034zbMath1245.05075OpenAlexW2143593209MaRDI QIDQ442317

Suohai Fan, Hong-Jian Lai, Senmei Yao, Deying Li

Publication date: 10 August 2012

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

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

zbMATH Keywords

group connectivitynowhere-zero flowsbrooks coloring theoremgroup colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
• Group connectivity of graphs with diameter at most 2
• Nowhere-zero 3-flows in triangularly connected graphs
• On group connectivity of graphs
• Nowhere-zero 6-flows
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group connectivity of 3-edge-connected chordal graphs
• Group colorability of multigraphs
• Nowhere-zero 3-flows in squares of graphs
• Group connectivity and group colorings of graphs --- a survey
• Nowhere‐zero 3‐flows in locally connected graphs
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: A dual version of the brooks group coloring theorem