On odd colorings of planar graphs
From MaRDI portal
Publication:6080172
DOI10.1016/j.disc.2023.113706zbMath1525.05052MaRDI QIDQ6080172
Xiaowei Yu, Zheng-Ke Miao, Zhuojie Tu, Lin Sun
Publication date: 30 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Vertex-arboricity of planar graphs without intersecting triangles
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
- Remarks on proper conflict-free colorings of graphs
- Conflict-free coloring bounds on open neighborhoods
- A tight bound for conflict-free coloring in terms of distance to cluster
- Colorings with neighborhood parity condition
- Remarks on odd colorings of graphs
- The odd chromatic number of a planar graph is at most 8
- Odd coloring of sparse graphs and planar graphs
- A note on odd colorings of 1-planar graphs
- 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 of Graphs
- Parameterized Complexity of Conflict-Free Graph Coloring
- A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs
- Conflict-Free Coloring and its Applications
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
- 1-planar graphs are odd 13-colorable
- A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs
This page was built for publication: On odd colorings of planar graphs