Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits

A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits In 2003, Borodin and Raspaud proved that if G is a plane graph without 5-circuits and without triangles of distance less than four, then G is 3-colorable. In this paper, we prove that if G is a plane graph without 5- and 6-circuits and without triangles of distance less than 2, then G is 3-colorable. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits

Acta Mathematicae Applicatae Sinica , Volume 30 (3) – Nov 6, 2014

Loading next page...
 
/lp/springer-journals/a-sufficient-condition-on-3-colorable-plane-graphs-without-5-and-6-DjBMi02omY

References (11)

Publisher
Springer Journals
Copyright
Copyright © 2014 by Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences and Springer-Verlag Berlin Heidelberg
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/s10255-014-0418-4
Publisher site
See Article on Publisher Site

Abstract

In 2003, Borodin and Raspaud proved that if G is a plane graph without 5-circuits and without triangles of distance less than four, then G is 3-colorable. In this paper, we prove that if G is a plane graph without 5- and 6-circuits and without triangles of distance less than 2, then G is 3-colorable.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Nov 6, 2014

There are no references for this article.