Chromatic capacities of graphs and hypergraphs
From MaRDI portal
Publication:1827711
DOI10.1016/j.disc.2003.06.016zbMath1161.05317OpenAlexW2032091720MaRDI QIDQ1827711
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.06.016
Related Items (10)
A lower bound for the chromatic capacity in terms of the chromatic number of a graph ⋮ On color critical graphs with large adaptable chromatic numbers ⋮ Adapted game colouring of graphs ⋮ The Adaptable Chromatic Number and the Chromatic Number ⋮ An asymptotically tight bound on the adaptable chromatic number ⋮ Chromatic capacity and graph operations ⋮ On a construction of graphs with high chromatic capacity and large girth ⋮ Adapted list coloring of planar graphs ⋮ Adaptable chromatic number of graph products ⋮ Adaptable choosability of planar graphs with sparse short cycles
Cites Work
- On a graph colouring problem
- Split and balanced colorings of complete graphs
- On the upper chromatic numbers of the reals
- Ramsey properties of orientations of graphs
- [https://portal.mardi4nfdi.de/wiki/Publication:4376497 The graph constructions ofHaj�s and Ore]
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Chromatic capacities of graphs and hypergraphs
