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

Simple item page
dc.creatorAkbari, S.
dc.creatorGh, Behrooz Bagheri
dc.date2008-10-20
dc.date.accessioned2026-07-07T10:11:30Z
dc.date.available2026-07-07T10:11:30Z
dc.descriptionLet 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.
dc.description2 pages
dc.identifierhttps://arxiv.org/abs/0810.3298
dc.identifierhttp://arxiv.org/abs/0810.3298
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/171881
dc.subjectCombinatorics
dc.titleA comment to: On 3-colorable planar graphs without short cycles
dc.typetext

Files

Collections

arXiv