Adapted list coloring of planar graphs
From MaRDI portal
Publication:3652546
DOI10.1002/jgt.20391zbMath1221.05136OpenAlexW4244252172MaRDI QIDQ3652546
Louis Esperet, Xuding Zhu, Mickaël Montassier
Publication date: 18 December 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20391
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (13)
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 ⋮ Adapted game colouring of graphs ⋮ The Adaptable Chromatic Number and the Chromatic Number ⋮ Cooperative colorings of forests ⋮ On the adaptable chromatic number of graphs ⋮ Kernelization for cycle transversal problems ⋮ The adaptable choosability number grows with the choosability number ⋮ An asymptotically tight bound on the adaptable chromatic number ⋮ An upper bound on adaptable choosability of graphs ⋮ Adaptable chromatic number of graph products ⋮ Adaptable choosability of planar graphs with sparse short cycles
Cites Work
- Unnamed Item
- Unnamed Item
- List colourings of planar graphs
- An upper bound on adaptable choosability of graphs
- Matrix partitions with finitely many obstructions
- Some counterexamples associated with the three-color problem
- On a graph colouring problem
- Split and balanced colorings of complete graphs
- Every planar graph is 5-choosable
- A short list color proof of Grötzsch's theorem
- Chromatic capacities of graphs and hypergraphs
- A not 3-choosable planar graph without 3-cycles
- On the upper chromatic numbers of the reals
- On the adaptable chromatic number of graphs
- Adapted List Coloring of Graphs and Hypergraphs
- Ramsey properties of orientations of graphs
- Full Constraint Satisfaction Problems
- On a conjecture of B. Grünbaum
This page was built for publication: Adapted list coloring of planar graphs
