How To Color Claw-Free Perfect Graphs

DOI10.1016/S0304-0208(08)73466-2MaRDI QIDQ3938517zbMATH OpenFDO

Authors

Publication date 1981

Published in North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-0208(08)73466-2

zbMATH Keywords

algorithmgraph coloringstrong perfect graph conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(14)

• Two classes of perfect graphs
• Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs
• Claw-free graphs---a survey
• A coloring algorithm for \(4 K_1\)-free line graphs
• A transformation which preserves the clique number
• On coloring a class of claw-free and hole-twin-free graphs
• On coloring a class of claw-free graphs.
• On the structure of graphs without claw, \(4K_1\) and co-R
• Classes of perfect graphs
• Mutual exclusion scheduling with interval graphs or related classes. II
• Perfect circular arc coloring
• A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
• Some sequential graph colouring algorithms
• On graphs without four-vertex induced subgraphs

This page was built for publication: How To Color Claw-Free Perfect Graphs

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