Coloring algorithms for K5-minor free graphs

TitleColoring algorithms for K5-minor free graphs
Publication TypeJournal Articles
Year of Publication1990
AuthorsKhuller S
JournalInformation Processing Letters
Volume34
Issue4
Pagination203 - 208
Date Published1990/04/24/
ISBN Number0020-0190
Keywordsgraph minor, Parallel algorithms, planar graph coloring
Abstract

In this paper we give an NC algorithm to five color K5-minor free graphs. We also give a polynomial time algorithm to obtain a four coloring for a K5-minor free graph.

URLhttp://www.sciencedirect.com/science/article/pii/002001909090161P
DOI10.1016/0020-0190(90)90161-P