Nested colourings of graphs

zbMATH Open1321.05078arXiv1306.0140MaRDI QIDQ2947386FDOQ2947386

David Cook II

Publication date: 23 September 2015

Abstract: A proper vertex colouring of a graph is emph{nested} if the vertices of each of its colour classes can be ordered by inclusion of their open neighbourhoods. Through a relation to partially ordered sets, we show that the nested chromatic number can be computed in polynomial time. Clearly, the nested chromatic number is an upper bound for the chromatic number of a graph. We develop multiple distinct bounds on the nested chromatic number using common properties of graphs. We also determine the behaviour of the nested chromatic number under several graph operations, including the direct, Cartesian, strong, and lexicographic product. Moreover, we classify precisely the possible nested chromatic numbers of graphs on a fixed number of vertices with a fixed chromatic number.

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

zbMATH Keywords

chromatic number of a finite simple graphnested chromatic numbers

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (3)

• The uniform face ideals of a simplicial complex
• Colored Nested Words
• The cyclic graph (deleted enhanced power graph) of a direct product

Uses Software

• Macaulay2
• nauty
• OEIS
• Nauty
• Posets

Recommendations

• Sur le coloriage des graphs 👍 👎
• TOTAL COLORING OF CERTAIN GRAPHS 👍 👎
• Colorings of hypergraphs 👍 👎
• The coloring of graphs 👍 👎
• Color-Induced Graph Colorings 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Nested colourings of graphs

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