Adapted list coloring of planar graphs
From MaRDI portal
Recommendations
- Adapted List Coloring of Graphs and Hypergraphs
- List colourings of planar graphs
- Multiple list colouring of planar graphs
- List colourings of planar graphs. (Reprint)
- Acyclic list edge coloring of planar graphs
- List injective coloring of planar graphs
- List injective coloring of planar graphs
- On list-coloring outerplanar graphs
- Dynamic coloring and list dynamic coloring of planar graphs
- List coloring triangle-free planar graphs
Cites work
- A not 3-choosable planar graph without 3-cycles
- A short list color proof of Grötzsch's theorem
- Adapted List Coloring of Graphs and Hypergraphs
- An upper bound on adaptable choosability of graphs
- Chromatic capacities of graphs and hypergraphs
- Every planar graph is 5-choosable
- Full Constraint Satisfaction Problems
- scientific article; zbMATH DE number 434910 (Why is no real title available?)
- List colourings of planar graphs
- Matrix partitions with finitely many obstructions
- On a conjecture of B. Grünbaum
- On a graph colouring problem
- On the adaptable chromatic number of graphs
- On the upper chromatic numbers of the reals
- Ramsey properties of orientations of graphs
- Some counterexamples associated with the three-color problem
- Split and balanced colorings of complete graphs
- Two algorithms for general list matrix partitions
Cited in
(16)- An upper bound on adaptable choosability of graphs
- Adaptable chromatic number of graph products
- Adaptable choosability of planar graphs with sparse short cycles
- On color critical graphs with large adaptable chromatic numbers
- On the adaptable chromatic number of graphs
- Cooperative colorings of forests
- The Adaptable Chromatic Number and the Chromatic Number
- Algorithms to approximately count and sample conforming colorings of graphs
- Adapted List Coloring of Graphs and Hypergraphs
- Adapted game colouring of graphs
- Kernelization for cycle transversal problems
- An asymptotically tight bound on the adaptable chromatic number
- A note on adaptable choosability and choosability with separation of planar graphs
- Adaptable and conflict colouring multigraphs with no cycles of length three or four
- The adaptable choosability number grows with the choosability number
- Cooperative coloring of some graph families
This page was built for publication: Adapted list coloring of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652546)
