How To Color Claw-Free Perfect Graphs
From MaRDI portal
Publication:3938517
DOI10.1016/S0304-0208(08)73466-2zbMath0479.68067MaRDI QIDQ3938517
No author found.
Publication date: 1981
Published in: North-Holland Mathematics Studies (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items (13)
On coloring a class of claw-free graphs. ⋮ Claw-free graphs---a survey ⋮ On the structure of graphs without claw, \(4K_1\) and co-R ⋮ Two classes of perfect graphs ⋮ A coloring algorithm for \(4 K_1\)-free line graphs ⋮ Classes of perfect graphs ⋮ Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs ⋮ Mutual exclusion scheduling with interval graphs or related classes. II ⋮ Some sequential graph colouring algorithms ⋮ Perfect circular arc coloring ⋮ On coloring a class of claw-free and hole-twin-free graphs ⋮ A transformation which preserves the clique number ⋮ A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
This page was built for publication: How To Color Claw-Free Perfect Graphs
