Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
A New 3-Color Criterion for Planar Graphs

A New 3-Color Criterion for Planar Graphs

Extended Abstract
Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 2573/2002
BookGraph-Theoretic Concepts in Computer Science
DOI10.1007/3-540-36379-3
Copyright2002
ISBN978-3-540-00331-1
DOI10.1007/3-540-36379-3_13
Pages138-149
Subject CollectionComputer Science
SpringerLink DateTuesday, January 01, 2002
Add to marked items

A New 3-Color Criterion for Planar Graphs
Extended Abstract

Krzysztof Diks5 Contact Information, Lukasz Kowalik5 Contact Information and Maciej Kurowski5 Contact Information

(5)  Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland
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.

Contact Information Krzysztof Diks
Email: diks@mimuw.edu.pl

Contact Information Lukasz Kowalik
Email: kowalik@mimuw.edu.pl

Contact Information Maciej Kurowski
Email: kuros@mimuw.edu.pl
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.107 • Server: mpweb18
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)