A New 3-Color Criterion for Planar Graphs

Authors:
Krzysztof Diks;Lukasz Kowalik;Maciej Kurowski
Affiliations:
-;-;-
Venue:
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
2002

Citing 1
Cited 0

Planar orientations with low out-degree and compaction of adjacency matrices

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new general 3-color criterion for planar graphs. Applying this criterion we characterize a broad class of 3-colorable planar graphs and provide a corresponding linear time 3-coloring algorithm. We also characterize fully infinite 3-colorable planar triangulations.