Nested colourings of graphs

MaRDI QIDQ2947386zbMATH OpenFDO

Authors David Cook II

Publication date 23 September 2015

Full work available at URL https://arxiv.org/abs/1306.0140, http://ajc.maths.uq.edu.au//pdf/62/ajc_v62_p100.pdf

zbMATH Keywords

chromatic number of a finite simple graphnested chromatic numbers

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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.

Recommendations

• The coloring of graphs
• scientific article; zbMATH DE number 1052826
• scientific article; zbMATH DE number 3912409
• Colorings of hypergraphs
• Sur le coloriage des graphs
• Color-induced graph colorings
• Color-induced graph colorings
• TOTAL COLORING OF CERTAIN GRAPHS
• scientific article; zbMATH DE number 6605085
• Graph colorings

Cited in

(3)

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

Describes a project that uses

Uses Software

• nauty
• OEIS
• Posets
• Macaulay2
• Nauty

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)