List-coloring claw-free graphs with small clique number

DOI10.1007/S00373-012-1272-XMaRDI QIDQ742576zbMATH OpenOpenAlexFDO

Authors L. Esperet, András Gyárfás, Frédéric Maffray

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)

Recommendations

• Claw-free graphs. VI: Colouring
• scientific article; zbMATH DE number 1123764
• On the choosability of claw-free perfect graphs
• Choice number of 3-colorable elementary graphs
• Clique-coloring claw-free graphs

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 1286500 (Why is no real title available?)
• scientific article; zbMATH DE number 3204305 (Why is no real title available?)
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• A note on Ramsey numbers
• Claw-free graphs. VI: Colouring
• Combinatorial Relations and Chromatic Graphs
• On the choice number of claw-free perfect graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t

Cited in

(4)

• A survey on the computational complexity of coloring graphs with forbidden subgraphs
• Claw-free graphs. VI: Colouring
• On the choosability of claw-free perfect graphs
• List-coloring claw-free graphs with \(\Delta-1\) colors

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)