Graph covers using \(t\)-colourable vertex sets.

DOI10.1016/S0012-365X(03)00246-2zbMath1033.05048MaRDI QIDQ1427470

Sulamita Klein, K. Kilakos, Sylvain Gravier, Jeannette C. M. Janssen

Publication date: 14 March 2004

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

zbMATH Keywords

Graph colouringPerfect graphsBox perfectionFrequency assignment

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Cites Work

• Unnamed Item
• Unnamed Item
• A min-max relation for the partial q-colourings of a graph. II: Box perfection
• Coflow polyhedra
• Minimax relations for the partial q-colorings of a graph
• Normal hypergraphs and the perfect graph conjecture
• The Solution of a Timetabling Problem
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: Graph covers using \(t\)-colourable vertex sets.