Short-chorded and perfect graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3889565 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3891425 (Why is no real title available?)
- scientific article; zbMATH DE number 3904622 (Why is no real title available?)
- A characterization of perfect graphs
- A new property of critical imperfect graphs and some consequences
- Alternating orientation and alternating colouration of perfect graphs
- New classes of perfect graphs
- On a property of the class of n-colorable graphs
- Representation of a finite graph by a set of intervals on the real line
- Star-cutsets and perfect graphs
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- Topics on perfect graphs
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
- Weakly triangulated graphs
Cited in
(9)- scientific article; zbMATH DE number 2159659 (Why is no real title available?)
- Recognition of quasi-Meyniel graphs
- A new class of perfect Hoàng graphs
- On minimal imperfect graphs without induced P₅
- On the optimal transversals of the odd cycles
- Cycle-perfect graphs are perfect
- Slightly triangulated graphs are perfect
- scientific article; zbMATH DE number 3904622 (Why is no real title available?)
- A note on sparseness conditions on chordless vertices of cycles
This page was built for publication: Short-chorded and perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174781)