20.500.12556/DiRROS-27408 A remark on a result on odd colorings of planar graphs A 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. coloring odd coloring planar graphs true false true Elsevier Angleški jezik Ni določen © 2026 The Author(s) Neznano 2026-02-05 15:43:25 2026-02-05 15:43:26 2026-02-06 03:51:21 0000-00-00 00:00:00 2026 0 0 5 str. iss. 6, [article no.] 115014 Vol. 349 Jun. 2026 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2026-06-01 519.17 0012-365X 10.1016/j.disc.2026.115014 266953475 https://www.sciencedirect.com/science/article/pii/S0012365X26000385 1 08cb0924-02a1-11f1-93b0-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=40094 RAZ_Pradhan_Dinabandhu_2026.pdf RAZ_Pradhan_Dinabandhu_2026.pdf 1 F56ABD88A5E0EDB21699A8767C09CA56 aefa83b939acdb897809c3f794db93e149271a65bdaa878c65f46ade6f15e805 3ac44b81-02a1-11f1-93b0-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=40095 Rudolfovo – Znanstveno in tehnološko središče Novo mesto 0 0 0