Graph covers using t-colourable vertex sets.

DOI10.1016/S0012-365X(03)00246-2zbMATH Open1033.05048MaRDI QIDQ1427470FDOQ1427470

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

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Normal hypergraphs and the perfect graph conjecture
• Blocking and anti-blocking pairs of polyhedra
• The Solution of a Timetabling Problem
• Minimax relations for the partial q-colorings of a graph
• Coflow polyhedra
• A min-max relation for the partial q-colourings of a graph. II: Box perfection

Cited In (2)

• The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
• Vertex coverings by coloured induced graphs — Frames and Umbrellas

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

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