On Tucker's proof of the strong perfect graph conjecture for \((K_4-e)\)-free graphs

DOI10.1016/S0012-365X(00)00352-6zbMath0978.05034WikidataQ123165469 ScholiaQ123165469MaRDI QIDQ5937451

Celina M. H. de Fiugueiredo, Sylvain Gravier, Cláudia Linhares Sales

Publication date: 27 January 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

maximal cliquesstrong perfect graph conjectureTucker verticesvertex coloring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)

This page was built for publication: On Tucker's proof of the strong perfect graph conjecture for \((K_4-e)\)-free graphs