Brooks-type theorem for \(r\)-hued coloring of graphs

DOI10.1016/j.dam.2023.02.008OpenAlexW4321381821WikidataQ122526981 ScholiaQ122526981MaRDI QIDQ2696623

Alfréd Onderko, Stanlislav Jendroľ

Publication date: 17 April 2023

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

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

zbMATH Keywords

bipartite graphdynamic coloringvertex-coloring\(r\)-hued coloring\(r\)-hued chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• On \(r\)-dynamic coloring of graphs
• Three short proofs in graph theory
• Balanced incomplete block designs and related designs
• New designs with block size 7
• Dynamic coloring parameters for graphs with given genus
• Graph \(r\)-hued colorings -- a survey
• Dynamic proper colorings of a graph
• A bound on the chromatic number of the square of a planar graph
• Some Remarks on the Triple Systems of Steiner.
• The Existence and Construction of Balanced Incomplete Block Designs
• ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
• Self-dual configurations and regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Brooks-type theorem for \(r\)-hued coloring of graphs