On conflict-free proper colourings of graphs without small degree vertices

DOI10.1016/j.disc.2023.113712zbMath1525.05049arXiv2212.08936MaRDI QIDQ6056427

Mateusz Kamyczura, Jakub Przybyło

Publication date: 30 October 2023

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

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

zbMATH Keywords

conflict-free chromatic numberodd colouringconflict-free colouring\(h\)-conflict-free chromatic number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Colorings with neighborhood parity condition
• Remarks on odd colorings of graphs
• A survey on the distance-colouring of graphs
• Conflict-Free Colourings of Uniform Hypergraphs With Few Edges
• Conflict-Free Colourings of Graphs and Hypergraphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Conflict-Free Coloring and its Applications
• Conflict-Free Colouring of Graphs

This page was built for publication: On conflict-free proper colourings of graphs without small degree vertices