Exponentially many \(\mathbb{Z}_5\)-colorings in simple planar graphs

DOI10.1016/j.disc.2021.112474zbMath1467.05078arXiv2011.12163OpenAlexW3170169978MaRDI QIDQ2037549

Carsten Thomassen, Rikke Langhede

Publication date: 8 July 2021

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

Full work available at URL: https://arxiv.org/abs/2011.12163

zbMATH Keywords

list coloringgroup connectivitygroup coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Graph polynomials and group coloring of graphs

Cites Work

• Unnamed Item
• The weak 3-flow conjecture and the weak circular flow conjecture
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Many 3-colorings of triangle-free planar graphs
• Exponentially many 5-list-colorings of planar graphs
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Every planar graph is 5-choosable
• Group connectivity and group coloring: small groups versus large groups
• A note on group colorings
• Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows

This page was built for publication: Exponentially many \(\mathbb{Z}_5\)-colorings in simple planar graphs