Graph polynomials and group coloring of graphs

DOI10.1016/j.ejc.2021.103505zbMath1486.05151arXiv2012.03230OpenAlexW4287556864MaRDI QIDQ2122688

Jarosław Grytczuk, Oriol Serra, Mariusz Zając, Bartłomiej Bosek, Grzegorz Gutowski

Publication date: 7 April 2022

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

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

zbMATH Keywords

list coloringgroup coloring\(K_5\)-minor-free graphs

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

An algebraic approach for counting DP-3-colorings of sparse graphs ⋮ Covering grids with multiplicity

Cites Work

• Unnamed Item
• Graph polynomials and paintability of plane graphs
• Exponentially many 5-list-colorings of planar graphs
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Covering the cube by affine hyperplanes
• Every planar graph is 5-choosable
• Group chromatic number of graphs without \(K_5\)-minors
• The Alon-Tarsi number of planar graphs
• On group choosability of graphs. II
• Exponentially many \(\mathbb{Z}_5\)-colorings in simple planar graphs
• The Alon-Tarsi number of \(K_5\)-minor-free graphs
• The Alon-Tarsi number of a planar graph minus a matching
• Mr. Paint and Mrs. Correct
• On-line list colouring of graphs
• Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
• A short proof of Combinatorial Nullstellensatz
• Combinatorial Nullstellensatz
• On Zeros of a Polynomial in a Finite Grid
• A note on group colorings

This page was built for publication: Graph polynomials and group coloring of graphs