List Colouring Constants of Triangle Free Graphs

DOI10.1016/J.ENDM.2008.01.024MaRDI QIDQ3503542zbMATH OpenOpenAlexFDO

Authors Omid Amini, Bruce Reed

Publication date 5 June 2008

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2008.01.024

zbMATH Keywords

graph colouringlist colouringprobabilistic methodrandomised algorithms

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Randomized algorithms (68W20)

Recommendations

• Coloring triangle-free graphs with local list sizes
• The list chromatic number of graphs with small clique number
• List coloring triangle-free planar graphs
• A note on list-colorings
• Asymptotically the list colouring constants are 1

Cites work

• A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
• A note on vertex list colouring
• Asymptotically the list colouring constants are 1
• Concentration of multivariate polynomials and its applications
• scientific article; zbMATH DE number 1299964 (Why is no real title available?)
• On a list coloring conjecture of Reed

Cited in

(10)

• The list chromatic number of graphs with small clique number
• Cooperative colorings of trees and of bipartite graphs
• List coloring triangle-free hypergraphs
• A note on list-colorings
• The -Ramsey problem for triangle-free graphs
• List coloring triangle-free planar graphs
• Coloring triangle-free graphs with local list sizes
• Colouring graphs with forbidden bipartite subgraphs
• Adaptable and conflict colouring multigraphs with no cycles of length three or four
• On triangle-free list assignments

This page was built for publication: List Colouring Constants of Triangle Free Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503542)