Quasi-parity and perfect graphs

DOI10.1016/0020-0190(94)00224-MzbMath0875.68686OpenAlexW2009757917MaRDI QIDQ1349738

Irena Rusu

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00224-m

zbMATH Keywords

AlgorithmsGraph theoryCombinatorial problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Path parity and perfection ⋮ On the \(P_ 4\)-structure of perfect graphs. IV: Partner graphs

Cites Work

• Unnamed Item
• Counterexamples to three conjectures concerning perfect graphs
• A semi-strong perfect graph theorem
• A new property of critical imperfect graphs and some consequences
• Star-cutsets and perfect graphs
• Coloring graphs with stable cutsets
• Building counterexamples
• A characterization of perfect graphs
• Transformations which Preserve Perfectness and H-Perfectness of Graphs

This page was built for publication: Quasi-parity and perfect graphs