scientific article; zbMATH DE number 3893237
From MaRDI portal
Publication:5184940
zbMath0561.05034MaRDI QIDQ5184940
No author found.
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmsmaximum weight cliqueclaw-free perfect graphsminimum cardinality coloringminimum weighted clique cover
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (4)
Claw-free graphs---a survey ⋮ A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs ⋮ A description of claw-free perfect graphs ⋮ Finding maximum cliques in arbitrary and in special graphs
This page was built for publication:
