On-line coloring of $I_s$-free graphs

An on-line vertex coloring algorithm receives vertices of a graph in some externally determined order. Each new vertex is presented together with a set of the edges connecting it to the previously presented vertices. As a vertex is presented, the algorithm assigns it a color which cannot be changed...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete mathematics and theoretical computer science Jg. DMTCS Proceedings vol. AF,...; H. Proceedings; S. 61 - 68
Hauptverfasser:	Cieslik, Iwona, Kozik, Marcin, Micek, Piotr
Format:	Journal Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	DMTCS 01.01.2005 Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science
Schriftenreihe:	DMTCS Proceedings
Schlagworte:	[info.info-hc] computer science [cs]/human-computer interaction [cs.hc] [info.info-lo] computer science [cs]/logic in computer science [cs.lo] [info.info-sc] computer science [cs]/symbolic computation [cs.sc] Computer Science graph coloring Human-Computer Interaction Logic in Computer Science on-line algorithm planar graph Symbolic Computation on-line algorithm graph coloring planar graph
ISSN:	1365-8050, 1462-7264, 1365-8050
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!