English

A comment to: On 3-colorable planar graphs without short cycles

Combinatorics 2008-10-21 v1
Authors: S. Akbari , Behrooz Bagheri Gh
View on arXiv ↗ PDF ↗

Abstract

Let G be a graph. It was proved that if G is a planar graph without {4, 6, 7}-cycles and without two 5-cycles sharing exactly one edge, then G 3-colorable. We observed that the proof of this result is not correct.

Keywords

graph coloring graph cycles graph theory

Cite

@article{arxiv.0810.3298,
  title  = {A comment to: On 3-colorable planar graphs without short cycles},
  author = {S. Akbari and Behrooz Bagheri Gh},
  journal= {arXiv preprint arXiv:0810.3298},
  year   = {2008}
}

Comments

2 pages

Related papers

View all related →
Combinatorics · Mathematics
Every planar graph without adjacent short cycles is 3-colorable
Tao Wang
2010-04-06
Combinatorics · Mathematics
The 3-colorability of planar graphs without cycles of length 4, 6 and 9
Yingli Kang, Ligang Jin, Yingqian Wang
2017-02-27
Combinatorics · Mathematics
Plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles are 3-colorable
Ligang Jin, Yingli Kang, Michael Schubert, Yingqian Wang
2017-02-27
Combinatorics · Mathematics
Planar graphs without cycles of length 4 or 5 are (11:3)-colorable
Zdeněk Dvořák, Xiaolan Hu
2019-07-16
Combinatorics · Mathematics
3-coloring triangle-free planar graphs with a precolored 8-cycle
Zdeněk Dvořák, Bernard Lidický
2016-12-16
Combinatorics · Mathematics
3-coloring triangle-free planar graphs with a precolored 9-cycle
Ilkyoo Choi, Jan Ekstein, Přemysl Holub, Bernard Lidický
2017-09-28
Combinatorics · Mathematics
The proof of Steinberg's three coloring conjecture
I. Cahit
2007-05-23
Combinatorics · Mathematics
(1,0,0)-colorability of planar graphs without cycles of length 4 or 6
Ligang Jin, Yingli Kang, Peipei Liu, Yingqian Wang
2020-01-03
Combinatorics · Mathematics
Planar graphs without normally adjacent short cycles
Fangyao Lu, Mengjiao Rao, Qianqian Wang, Tao Wang
2022-06-13
Combinatorics · Mathematics
The Alon-Tarsi number of planar graphs without cycles of lengths $4$ and $l$
Huajing Lu, Xuding Zhu
2019-10-29
Combinatorics · Mathematics
Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
Pongpat Sittitrai, Kittikorn Nakprasit
2016-12-01
Combinatorics · Mathematics
DP-3-colorability of planar graphs without cycles of length 4, 7 or 9
Yingli Kang, Ligang Jin, Xuding Zhu
2023-03-09
Combinatorics · Mathematics
3-choosability of planar graphs with (<=4)-cycles far apart
Z. Dvorak
2012-05-28
Combinatorics · Mathematics
Planar graphs without 5-cycles and intersecting triangles are $(1,1,0)$-colorable
Runrun Liu, Xiangwen Li, Gexin Yu
2014-09-29
Combinatorics · Mathematics
Every signed planar graph without cycles of length from 4 to 7 is 3-colorable
Lan Kaiyang, Liu Feng
2022-05-04
Combinatorics · Mathematics
Planar graphs without $5^{-}$-cycles at distance less than $3$ are $(\mathcal{I}, \mathcal{F})$-colorable
Zhen He, Tao Wang, Xiaojing Yang
2023-11-07
Combinatorics · Mathematics
Planar graphs without pairwise adjacent 3-,4-,5-, and 6-cycle are 4-choosable
Pongpat Sittitrai, Kittikorn Nakprasit
2019-01-03
Discrete Mathematics · Computer Science
Planar graphs are acyclically edge $(\Delta + 5)$-colorable
Qiaojun Shu, Guohui Lin
2023-06-29
Combinatorics · Mathematics
Planar graphs without 4-cycles and close triangles are (2,0,0)-colorable
Heather Hoskins, Runrun Liu, Jennifer Vandenbussche, Gexin Yu
2018-06-21
Discrete Mathematics · Computer Science
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
Qiaojun Shu, Guohui Lin, Eiji Miyano
2020-05-14
Discrete Mathematics · Computer Science
Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle
Zdenek Dvorak, Dan Kral, Robin Thomas
2017-03-28
Combinatorics · Mathematics
$(3,1)^*$-choosability of planar graphs without adjacent short cycles
Min Chen, Andre Raspaud
2013-02-12
Combinatorics · Mathematics
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
Daniel W. Cranston
2011-10-12
Combinatorics · Mathematics
Planar graphs without cycles of length 4 or 5 are $(7m:2m)$-DP-colorable
Xiaoyan Xu, Xuding Zhu
2025-11-18
Combinatorics · Mathematics
Steinberg's Conjecture is false
Vincent Cohen-Addad, Michael Hebdige, Daniel Kral, Zhentao Li +1
2016-04-20
R2 v1 2026-06-21T11:32:20.179Z