Open Access
| Issue |
Wuhan Univ. J. Nat. Sci.
Volume 30, Number 5, October 2025
|
|
|---|---|---|
| Page(s) | 453 - 457 | |
| DOI | https://doi.org/10.1051/wujns/2025305453 | |
| Published online | 04 November 2025 | |
- Bondy J A, Murty U S R. Graph Theory[M]. New York: Springer-Verlag, 2008. [Google Scholar]
- Fabrici I, Lužar B, Rindošová S, et al. Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods[J]. Discrete Applied Mathematics, 2023, 324: 80-92. [Google Scholar]
- Caro Y, Petruševski M, Škrekovski R. Remarks on proper conflict-free colorings of graphs[J]. Discrete Math, 2023, 346(2): 113221. [Google Scholar]
- Liu C H, Yu G X. Linear colorings of subcubic graphs[J]. European Journal of Combinatorics, 2013, 34(6): 1040-1050. [Google Scholar]
- Jiménez A, Knauer K, Lintzmayer C N, et al. Boundedness for proper conflict-free and odd colorings[EB/OL]. [2024-10-15]. http://www.arXiv:2308.00170. [Google Scholar]
- Ahn J, Im S, Oum S. The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs[EB/OL]. [2024-10-15]. http://www.arXiv:2208.08330. [Google Scholar]
- Caro Y, Petruševski M, Škrekovski R. Remarks on odd colorings of graphs[J]. Discrete Applied Mathematics, 2022, 321: 392-401. [Google Scholar]
- Cho E K, Choi I, Kwon H, et al. Proper conflict-free coloring of sparse graphs[J]. Discrete Applied Mathematics, 2025, 362: 34-42. [Google Scholar]
- Cho E K, Choi I, H Kwonet al. Odd coloring of sparse graphs and planar graphs[J]. Discrete Mathematics, 2023, 346(5): 113305. [Google Scholar]
- Cranston D W, West D B. An introduction to the discharging method via graph coloring[J]. Discrete Mathematics, 2017, 340(4): 766-793. [Google Scholar]
- Cranston D W, Liu C H. Proper conflict-free coloring of graphs with large maximum degree[J]. SIAM Journal on Discrete Mathematics, 2024, 38(4): 3004-3027. [Google Scholar]
- Kamyczura M, Przybyło J. On conflict-free proper colourings of graphs without small degree vertices[J]. Discrete Mathematics, 2024, 347(1): 113712. [Google Scholar]
- Liu C H. Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth[J]. Discrete Mathematics, 2024, 347(1): 113668. [Google Scholar]
- Tian F Y, Yin Y X. Every toroidal graph without 3-cycles is odd 7-colorable [EB/OL]. [2024-10-15]. http://www.arXiv:2206.06052. [Google Scholar]
- Tian F Y, Yin Y X. Every toroidal graph without adjacent triangles is odd 8-colorable [EB/OL]. [2024-10-15]. http://www.arXiv:2206.07629. [Google Scholar]
- Tian F Y, Yin Y X. The odd chromatic number of a toroidal graph is at most 9[J]. Information Processing Letters, 2023, 182: 106384. [Google Scholar]
- Wang T, Yang X J. On odd colorings of sparse graphs[J]. Discrete Applied Mathematics, 2024, 345: 156-169. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.