A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs

DOI10.1017/S0963548301004898zbMath0991.05041OpenAlexW2053777090MaRDI QIDQ4330738

Van H. Vu

Publication date: 25 August 2002

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548301004898

zbMATH Keywords

random graphlist chromatic numberlocally sparse graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (17)

Strong edge colorings of uniform graphs ⋮ On the strong chromatic index of sparse graphs ⋮ On the Lovász Theta Function for Independent Sets in Sparse Graphs ⋮ The strong clique index of a graph with forbidden cycles ⋮ List Colouring Constants of Triangle Free Graphs ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Distance colouring without one cycle length ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering ⋮ Distance edge-colourings and matchings ⋮ Strong cliques and forbidden cycles ⋮ Distance Colouring Without One Cycle Length ⋮ Bounding the strong chromatic index of dense random graphs ⋮ Edge‐coloring linear hypergraphs with medium‐sized edges ⋮ On distance edge-colourings and matchings ⋮ Some Results on Chromatic Number as a Function of Triangle Count ⋮ Distributed coloring algorithms for triangle-free graphs

This page was built for publication: A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs