Cooperative colorings of forests
From MaRDI portal
Publication:2684895
DOI10.37236/11461OpenAlexW4319722891MaRDI QIDQ2684895
Publication date: 17 February 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.10968
Cites Work
- Unnamed Item
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Cooperative colorings of trees and of bipartite graphs
- Cooperative colorings and independent systems of representatives
- Independent transversals in locally sparse graphs
- On the adaptable chromatic number of graphs
- A Note on Vertex List Colouring
- The Adaptable Chromatic Number and the Chromatic Number
- Adapted List Coloring of Graphs and Hypergraphs
- Adapted list coloring of planar graphs
- An asymptotically tight bound on the adaptable chromatic number
- Fractional DP‐colorings of sparse graphs
- Graph colouring and the probabilistic method