Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
DOI10.1016/j.dam.2022.09.011zbMath1502.05062arXiv2202.02570OpenAlexW4300861154MaRDI QIDQ2097169
Igor Fabrici, Borut Lužar, Roman Soták, Simona Rindošová
Publication date: 11 November 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.02570
plane graphclosed neighborhoodopen neighborhoodproper conflict-free coloringproper unique-maximum coloring
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
Cites Work
- Graph unique-maximum and conflict-free colorings
- Adynamic coloring of graphs
- Unique-maximum coloring of plane graphs
- The square of a planar cubic graph is 7-colorable
- A counterexample to a conjecture on facial unique-maximal colorings
- Conflict-free coloring of string graphs
- Combinatorial bounds for conflict-free coloring on open neighborhoods
- Conflict-free coloring bounds on open neighborhoods
- Colorings with neighborhood parity condition
- Remarks on odd colorings of graphs
- Coloring of Plane Graphs with Unique Maximal Colors on Faces
- Parity vertex colorings of binomial trees
- Parity vertex colouring of graphs
- Conflict-Free Colourings of Graphs and Hypergraphs
- Colouring vertices of plane graphs under restrictions given by faces
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Conflict-Free Coloring of Graphs
- A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs
- Conflict-Free Coloring and its Applications
- From NMNR-coloring of hypergraphs to homogenous coloring of graphs
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
- Conflict‐free chromatic number versus conflict‐free chromatic index
This page was built for publication: Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods