No odd pairs in minimal imperfect NP\({}_{5}\) graphs.

DOI10.1016/S0020-0190(01)00329-5zbMath1043.05055OpenAlexW2023742793MaRDI QIDQ1853069

Jean-Luc Fouquet

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00329-5

zbMATH Keywords

Graph algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Perfect graphs (05C17)

Cites Work

• Coloring perfect \((K_ 4\)-e)-free graphs
• A new conjecture about minimal imperfect graphs
• A new property of critical imperfect graphs and some consequences
• Star-cutsets and perfect graphs
• Some properties of minimal imperfect graphs
• On minimal imperfect graphs without induced \(P_5\)
• Discs in unbreakable graphs
• Transformations which Preserve Perfectness and H-Perfectness of Graphs
• On minimal cutsets in \(P_5\)-free minimal imperfect graphs

This page was built for publication: No odd pairs in minimal imperfect NP\({}_{5}\) graphs.