Forced color classes, intersection graphs and the strong perfect graph conjecture

DOI10.1016/S0304-3975(99)00201-7zbMath0943.68124OpenAlexW2063103911WikidataQ122900406 ScholiaQ122900406MaRDI QIDQ1978716

Tadashi Sakuma

Publication date: 4 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00201-7

zbMATH Keywords

strong perfect graph conjectureforced color classminimally imperfect graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Graphical properties related to minimal imperfection
• Critical perfect graphs and perfect 3-chromatic graphs
• On critical edges in minimal imperfect graphs
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Perfect zero–one matrices

This page was built for publication: Forced color classes, intersection graphs and the strong perfect graph conjecture