On Tucker vertices of graphs

DOI10.1016/S0012-365X(99)00023-0zbMath0932.05029WikidataQ127878755 ScholiaQ127878755MaRDI QIDQ1301659

Sylvain Gravier

Publication date: 20 December 1999

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

zbMATH Keywords

chromatic numberperfect graphTucker algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Coloring perfect \((K_ 4\)-e)-free graphs
• A reduction procedure for coloring perfect \(K_ 4\)-free graphs
• On weakly diamond-free Berge graphs
• Coloring perfect degenerate graphs
• An algorithm for coloring some perfect graphs

This page was built for publication: On Tucker vertices of graphs