| Title: | A remark on a result on odd colorings of planar graphs |
|---|
| Authors: | ID Pradhan, Dinabandhu (Author)
ID Sharma, Vaishali (Author)
ID Škrekovski, Riste (Author) |
|---|
| Files: |  URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S0012365X26000385
 PDF - Presentation file, download (592,05 KB)
MD5: F56ABD88A5E0EDB21699A8767C09CA56
|
|---|
| Language: | English |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: |  RUDOLFOVO - Rudolfovo - Science and Technology Centre Novo Mesto
|
|---|
| Abstract: | 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. |
|---|
| Keywords: | coloring, odd coloring, planar graphs |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 01.06.2026 |
|---|
| Publisher: | Elsevier |
|---|
| Year of publishing: | 2026 |
|---|
| Number of pages: | 5 str. |
|---|
| Numbering: | Vol. 349, iss. 6, [article no.] 115014 |
|---|
| PID: | 20.500.12556/DiRROS-27408  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 0012-365X |
|---|
| DOI: | 10.1016/j.disc.2026.115014 |
|---|
| COBISS.SI-ID: | 266953475 |
|---|
| Copyright: | © 2026 The Author(s) |
|---|
| Publication date in DiRROS: | 05.02.2026 |
|---|
| Views: | 50 |
|---|
| Downloads: | 14 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
