List-coloring claw-free graphs with small clique number

DOI10.1007/s00373-012-1272-xzbMath1298.05115OpenAlexW2162826395MaRDI QIDQ742576

Louis Esperet, Frédéric Maffray, András Gyárfás

Publication date: 19 September 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1272-x

zbMATH Keywords

chromatic numberclaw-free graphslist coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Claw-free graphs. VI: Colouring
• A note on Ramsey numbers
• On the choice number of claw-free perfect graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Combinatorial Relations and Chromatic Graphs

This page was built for publication: List-coloring claw-free graphs with small clique number