Search
Abstract
For a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function of any stingy on-line P-coloring algorithm. In the class of generalized trees, we characterize graphs critical for the greedy P-coloring. A class of graphs for which a greedy algorithm always generates optimal P-colorings for the property P = K3-free is given.
Citations
-
2
CrossRef
-
0
Web of Science
-
0
Scopus
Cite as
Full text
download paper
downloaded 28 times
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.7151/dmgt.1331
- License
-
open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
Discussiones Mathematicae Graph Theory
no. 26,
edition 3,
pages 389 - 401,
ISSN: 1234-3099 - Language:
- English
- Publication year:
- 2006
- Bibliographic description:
- Borowiecki P.: On-line P-coloring of graphs// Discussiones Mathematicae Graph Theory. -Vol. 26, iss. 3 (2006), s.389-401
- DOI:
- Digital Object Identifier (open in new tab) 10.7151/dmgt.1331
- Verified by:
- Gdańsk University of Technology
seen 130 times