A small non-\(\mathbb Z_4\)-colorable planar graph

DOI10.1016/j.disc.2006.09.003zbMath1119.05046OpenAlexW1563206199WikidataQ33418612 ScholiaQ33418612MaRDI QIDQ879348

Mickaël Montassier

Publication date: 11 May 2007

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

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

zbMATH Keywords

combinatorial problemschoosabilitygroup coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Generalized signed graphs of large girth and large chromatic number ⋮ \(4\)-colouring of generalized signed planar graphs ⋮ Group chromatic number of Halin graphs

Cites Work

• Unnamed Item
• List colourings of planar graphs
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• The 4-choosability of plane graphs without 4-cycles
• Every planar graph is 5-choosable
• Group chromatic number of graphs without \(K_5\)-minors
• Choosability of \(K_5\)-minor-free graphs
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• A note on group colorings

This page was built for publication: A small non-\(\mathbb Z_4\)-colorable planar graph