Proper conflict-free coloring of sparse graphs

DOI10.1016/j.dam.2024.11.016MaRDI QIDQ6657259

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

Publication date: 6 January 2025

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

zbMATH Keywords

proper conflict-free chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The four-colour theorem
• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
• Remarks on proper conflict-free colorings of graphs
• Colorings with neighborhood parity condition
• A survey on the distance-colouring of graphs
• Odd coloring of sparse graphs and planar graphs

Related Items (1)

Proper conflict-free coloring of graphs with large maximum degree

This page was built for publication: Proper conflict-free coloring of sparse graphs