A remark on a result on odd colorings of planar graphsPradhan, Dinabandhu (Avtor) Sharma, Vaishali (Avtor) Škrekovski, Riste (Avtor) coloringodd coloringplanar graphsA proper ▫$k$▫-coloring of a graph is said to be odd if every non-isolated vertex has a color that appears an odd number of times on its neighborhood. Miao et al. (2024) [2] claimed that every planar graph without adjacent ▫$3$▫-cycles is odd ▫$7$▫-colorable and every triangle-free planar graph without intersecting ▫$4$▫-cycles is odd ▫$5$▫-colorable. Here, we point out that their published proof contains a fundamental flaw which affects the validity of the main results.Elsevier20262026-02-05 15:43:25Neznano27408UDK: 519.17ISSN pri članku: 0012-365XDOI: 10.1016/j.disc.2026.115014COBISS_ID: 266953475sl© 2026 The Author(s)