Sciweavers

Share
DM
2010

Planar graphs without adjacent cycles of length at most seven are 3-colorable

8 years 6 months ago
Planar graphs without adjacent cycles of length at most seven are 3-colorable
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar graphs.
Oleg V. Borodin, Mickaël Montassier, Andr&eac
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2010
Where DM
Authors Oleg V. Borodin, Mickaël Montassier, André Raspaud
Comments (0)
books