Asymptotically good edge correspondence colourings
From MaRDI portal
Publication:6081556
DOI10.1002/jgt.22796zbMath1522.05133OpenAlexW4207028927MaRDI QIDQ6081556
Michael S. O. Molloy, Luke Postle
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22796
Related Items (4)
Graph and hypergraph colouring via nibble methods: a survey ⋮ On triangle-free list assignments ⋮ Edge-colouring graphs with local list sizes ⋮ Non-chromatic-adherence of the DP color function via generalized theta graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colouring graphs when the number of colours is almost the maximum degree
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Edge-choosability in line-perfect multigraphs
- A sufficient condition for DP-4-colorability
- The list chromatic index of a bipartite multigraph
- Asymptotically good list-colorings
- Concentration of measure and isoperimetric inequalities in product spaces
- DP-colorings of graphs with high chromatic number
- The asymptotic behavior of the correspondence chromatic number
- A Note on Vertex List Colouring
- Near-optimal list colorings
- Sharp Dirac's theorem for DP‐critical graphs
- The Johansson‐Molloy theorem for DP‐coloring
- A local epsilon version of Reed's conjecture
- 25 pretty graph colouring problems
- Graph colouring and the probabilistic method
This page was built for publication: Asymptotically good edge correspondence colourings