Brooks-type theorems for relaxations of square colorings

DOI10.1016/J.DISC.2024.114233MaRDI QIDQ6635100zbMATH OpenFDO

Authors Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park

Publication date 9 November 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114233

zbMATH Keywords

brooks-typeproper conflict-free coloringsquare coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On conflict-free proper colourings of graphs without small degree vertices
• Remarks on proper conflict-free colorings of graphs
• Proper conflict-free coloring of graphs with large maximum degree
• Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs

Cites work

• 1-planar graphs are odd 13-colorable
• A note on odd colorings of 1-planar graphs
• A survey on the distance-colouring of graphs
• Brooks-type theorem for \(r\)-hued coloring of graphs
• Characterizations of graphs having orientations satisfying local degree restrictions
• Colorings with neighborhood parity condition
• Conflict-free colourings of graphs and hypergraphs
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• Linear colorings of subcubic graphs
• Odd coloring of sparse graphs and planar graphs
• Odd colourings, conflict-free colourings and strong colouring numbers
• On \(r\)-dynamic coloring of graphs
• On conflict-free proper colourings of graphs without small degree vertices
• On odd colorings of sparse graphs
• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
• Proper conflict-free coloring of graphs with large maximum degree
• Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
• Remarks on odd colorings of graphs
• Remarks on proper conflict-free colorings of graphs
• The odd chromatic number of a planar graph is at most 8
• The odd chromatic number of a toroidal graph is at most 9

Cited in

(9)

• On conflict-free proper colourings of graphs without small degree vertices
• New bounds for odd colourings of graphs
• Remarks on proper conflict-free degree-choosability of graphs with prescribed degeneracy
• New bounds for proper h-conflict-free colorings
• On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs
• Proper conflict-free degree-choosability of outerplanar graphs
• Proper conflict-free 6-coloring of planar graphs without short cycles
• Asymptotically optimal proper conflict-free coloring
• Results on proper conflict-free list coloring of graphs

This page was built for publication: Brooks-type theorems for relaxations of square colorings

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