Single‐conflict colouring
From MaRDI portal
Publication:6055933
DOI10.1002/jgt.22646zbMath1521.05041OpenAlexW3094842658MaRDI QIDQ6055933
Ross J. Kang, Louis Esperet, Zdeněk Dvořák, Kenta Ozeki
Publication date: 29 September 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22646
Related Items (5)
Asymmetric list sizes in bipartite graphs ⋮ A General Framework for Hypergraph Coloring ⋮ Colorings, transversals, and local sparsity ⋮ Graphs of low average degree without independent transversals ⋮ List 4-colouring of planar graphs
Cites Work
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Colorings and orientations of graphs
- Complexity of choosing subsets from color sets
- The local cut lemma
- On the adaptable chromatic number of graphs
- The asymptotic behavior of the correspondence chromatic number
- Adapted List Coloring of Graphs and Hypergraphs
- Brooks-type theorems for choosability with separation
- Separation Choosability and Dense Bipartite Induced Subgraphs
- Choosability with Separation of Complete Multipartite Graphs and Hypergraphs
- A note on group colorings
- Graph colouring and the probabilistic method
- Unnamed Item
- Unnamed Item
This page was built for publication: Single‐conflict colouring