On the choosability of claw-free perfect graphs

DOI10.1007/s00373-016-1732-9zbMath1353.05055arXiv1506.02576OpenAlexW2260816206MaRDI QIDQ503632

Frédéric Maffray, Sylvain Gravier, Lucas Pastor

Publication date: 13 January 2017

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

Full work available at URL: https://arxiv.org/abs/1506.02576

zbMATH Keywords

claw-free graphchoosabilitylist coloringperfect

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Cites Work

• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• Decomposition by clique separators
• Recognizing claw-free perfect graphs
• An algorithm for finding clique cut-sets
• Colorings and orientations of graphs
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• A description of claw-free perfect graphs
• Choice number of 3-colorable elementary graphs
• On the choice number of claw-free perfect graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The list chromatic index of a bipartite multigraph
• Some upper bounds on the total and list chromatic numbers of multigraphs

This page was built for publication: On the choosability of claw-free perfect graphs