List-coloring claw-free graphs with small clique number

DOI10.1007/S00373-012-1272-XzbMATH Open1298.05115OpenAlexW2162826395MaRDI QIDQ742576FDOQ742576

L. 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 numberlist coloringclaw-free graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

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

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

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