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

DOI10.1016/S0304-3975(99)00201-7zbMATH Open0943.68124OpenAlexW2063103911WikidataQ122900406 ScholiaQ122900406MaRDI QIDQ1978716FDOQ1978716

Authors: 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

Recommendations

• On critical edges in minimal imperfect graphs
• The strong perfect graph theorem
• A survey of the strong perfect graph conjecture and some recent results
• scientific article; zbMATH DE number 1789914

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

• Normal hypergraphs and the perfect graph conjecture
• A characterization of perfect graphs
• Perfect zero–one matrices
• Critical perfect graphs and perfect 3-chromatic graphs
• Graphical properties related to minimal imperfection
• On critical edges in minimal imperfect graphs
• Title not available (Why is that?)

Cited In (1)

• Forcing structures and cliques in uniquely vertex colorable graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978716)