On the adaptable chromatic number of graphs
From MaRDI portal
Publication:2427540
DOI10.1016/j.ejc.2007.11.015zbMath1147.05031OpenAlexW1979198925MaRDI QIDQ2427540
Publication date: 13 May 2008
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2007.11.015
Related Items (14)
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 ⋮ Adapted game colouring of graphs ⋮ The Adaptable Chromatic Number and the Chromatic Number ⋮ Cooperative colorings of forests ⋮ The adaptable choosability number grows with the choosability number ⋮ An asymptotically tight bound on the adaptable chromatic number ⋮ Rainbow graph splitting ⋮ A new proof of validity of Bouchet's conjecture on Eulerian bidirected graphs ⋮ Adapted list coloring of planar graphs ⋮ Adaptable chromatic number of graph products ⋮ Adaptable choosability of planar graphs with sparse short cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Local chromatic number, Ky Fan's theorem, and circular colorings
- On acyclic colorings of planar graphs
- Good and semi-strong colorings of oriented planar graphs
- The circular chromatic number of series-parallel graphs of large odd girth
- Homomorphisms of graphs into odd cycles
- Acyclic and oriented chromatic numbers of graphs
- A note on the star chromatic number
- Adapted List Coloring of Graphs and Hypergraphs
- Adapted list coloring of planar graphs
- Star chromatic number
- Approximate graph coloring by semidefinite programming
- List Partitions
- Full Constraint Satisfaction Problems
- Circular chromatic number: A survey
- Construction of sparse graphs with prescribed circular colorings
This page was built for publication: On the adaptable chromatic number of graphs
