Nondegenerate colourings in the Brooks theorem

DOI10.1515/DMA.2009.036zbMath1237.05074arXiv0812.0372MaRDI QIDQ3225894

N. V. Gravin

Publication date: 23 March 2012

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

Full work available at URL: https://arxiv.org/abs/0812.0372

zbMATH Keywords

\((c,p)\)-nondegenerate vertex \(D\)-colouring of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

On proper colorings of hypergraphs ⋮ Dynamic proper colorings of a graph

Cites Work

• Colouring a graph frugally

This page was built for publication: Nondegenerate colourings in the Brooks theorem