On odd colorings of planar graphs
Authors:
- Zhengke MiaoZMZhengke Miao
- Lin SunLSLin Sun
- Zhuojie TuZTZhuojie Tu
- Xiaowei YuXYXiaowei Yu
- 27 September 2023
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (1)
Abstract
No abstract availableKeywords
Funding Information
- NSFC (11901252, 11971205, 12031018, 12101285)
This publication has 18 references indexed in Scilit:
- A tight bound for conflict-free coloring in terms of distance to clusterDiscrete Mathematics, 2022
- Conflict-Free Coloring Bounds on Open NeighborhoodsAlgorithmica, 2022
- A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphsJournal of Graph Theory, 2021
- Parameterized Complexity of Conflict-Free Graph ColoringSIAM Journal on Discrete Mathematics, 2021
- A Short Note on Open-Neighborhood Conflict-Free Colorings of GraphsSIAM Journal on Discrete Mathematics, 2020
- Conflict-Free Coloring of GraphsSIAM Journal on Discrete Mathematics, 2018
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree GraphsSIAM Journal on Discrete Mathematics, 2013
- Vertex-arboricity of planar graphs without intersecting trianglesEuropean Journal of Combinatorics, 2012
- Conflict-Free Colourings of Graphs and HypergraphsCombinatorics, Probability and Computing, 2009
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular NetworksSIAM Journal on Computing, 2003