scientific article; zbMATH DE number 3893237
From MaRDI portal
Publication:5184940
Recommendations
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\)
- Minimum weighted clique cover on claw‐free perfect graphs
- Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
Cited in
(18)- A description of claw-free perfect graphs
- scientific article; zbMATH DE number 3908479 (Why is no real title available?)
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- Claw-free graphs---a survey
- Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- Clique covers in claw-free Berge graphs
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- On the Maximum Weight Clique Problem
- Packing \(r\)-cliques in weighted chordal graphs
- Minimum weighted clique cover on strip-composed perfect graphs
- Minimum weighted clique cover on claw‐free perfect graphs
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- Recognizing claw-free perfect graphs
- Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs
- Finding maximum cliques in arbitrary and in special graphs
- Weighted well-covered claw-free graphs
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
- Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5184940)
