A strengthening and an efficient implementation of Alon-Tarsi list coloring method

DOI10.37236/12058OpenAlexW4391679158MaRDI QIDQ6197808

Zdeněk Dvořák

Publication date: 19 February 2024

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

Full work available at URL: https://doi.org/10.37236/12058

zbMATH Keywords

chromatic numberorientationspolynomial methodvertex-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• A dichotomy for real weighted Holant problems
• An introduction to the discharging method via graph coloring
• List colourings of planar graphs
• Colorings and orientations of graphs
• A solution to a colouring problem of P. Erdős
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Every planar graph is 5-choosable
• The Alon-Tarsi number of planar graphs
• The complexity of planar Boolean \#CSP with complex weights
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
• Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
• Unnamed Item
• Unnamed Item

This page was built for publication: A strengthening and an efficient implementation of Alon-Tarsi list coloring method