On the Alon-Tarsi number of semi-strong product of graphs

DOI10.1007/s10878-023-01099-2MaRDI QIDQ6181341

Lin Niu, Xiangwen Li

Publication date: 22 January 2024

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

graph coloringlist coloringcombinatorial NullstellensatzAlon-Tarsi numbersemi-strong product

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• On two generalizations of the Alon-Tarsi polynomial method
• On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs
• Brooks' theorem via the Alon-Tarsi theorem
• Proof of the list edge coloring conjecture for complete graphs of prime degree
• Planar graphs are 1-relaxed, 4-choosable
• Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
• Colorings and orientations of graphs
• Every planar graph is 5-choosable
• The Alon-Tarsi number of planar graphs
• Alon-Tarsi numbers of direct products
• The Alon-Tarsi number of a planar graph minus a matching
• The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)
• Combinatorial Nullstellensatz
• The Alon-Tarsi number of a toroidal grid

This page was built for publication: On the Alon-Tarsi number of semi-strong product of graphs