Adapted List Coloring of Graphs and Hypergraphs

DOI10.1137/070698385zbMath1170.05309OpenAlexW2008006594MaRDI QIDQ3614214

Xuding Zhu, Alexandr V. Kostochka

Publication date: 16 March 2009

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

Full work available at URL: https://doi.org/10.1137/070698385

zbMATH Keywords

list coloringdegree conditionsadapted coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (17)

Algorithms to approximately count and sample conforming colorings of graphs ⋮ On color critical graphs with large adaptable chromatic numbers ⋮ Adaptable and conflict colouring multigraphs with no cycles of length three or four ⋮ Single‐conflict colouring ⋮ Clique versus independent set ⋮ Adapted game colouring of graphs ⋮ The Adaptable Chromatic Number and the Chromatic Number ⋮ Cooperative colorings of forests ⋮ On the adaptable chromatic number of graphs ⋮ The adaptable choosability number grows with the choosability number ⋮ An asymptotically tight bound on the adaptable chromatic number ⋮ Rainbow graph splitting ⋮ An upper bound on adaptable choosability of graphs ⋮ Separation Choosability and Dense Bipartite Induced Subgraphs ⋮ Adapted list coloring of planar graphs ⋮ Adaptable chromatic number of graph products ⋮ Adaptable choosability of planar graphs with sparse short cycles

This page was built for publication: Adapted List Coloring of Graphs and Hypergraphs