On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs

zbMath1409.05110arXiv1803.07455MaRDI QIDQ668046

Hemanshu Kaul, Jeffrey A. Mudrock

Publication date: 5 March 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Acyclic choosability of graphs with bounded degree ⋮ The Alon-Tarsi number of a toroidal grid ⋮ On the Alon-Tarsi number of semi-strong product of graphs ⋮ Combinatorial Nullstellensatz and DP-coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On two generalizations of the Alon-Tarsi polynomial method
• Colorings and orientations of graphs
• Choice number of 3-colorable elementary graphs
• List edge and list total colourings of multigraphs
• Choosability of powers of circuits
• The Alon-Tarsi number of planar graphs
• The list chromatic index of a bipartite multigraph
• Asymptotically good list-colorings
• Criticality, the list color function, and list coloring the Cartesian product of graphs
• Mr. Paint and Mrs. Correct
• Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
• Three topics in online list coloring
• List coloring of Cartesian products of graphs
• Some upper bounds on the total and list chromatic numbers of multigraphs
• On chromatic‐choosable graphs
• A Proof of a Conjecture of Ohba

This page was built for publication: On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs