Fast 3-coloring Triangle-Free Planar Graphs

Lukasz Kowalik
2009 Algorithmica  
We show the first o(n 2 ) algorithm for coloring vertices of triangle-free planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be also used to design O(n polylog n)-time algorithms for two other similar coloring problems.
doi:10.1007/s00453-009-9295-2 fatcat:edrs6hmx2facbkofgdmtfnfd44