✦ LIBER ✦

On-line graph coloring of({mathbb{P}_5})-free graphs

✍ Scribed by Iwona Cieślik

Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 381 KB
Volume: 45
Category: Article
ISSN: 0001-5903
DOI: 10.1007/s00236-007-0064-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Effective on-line coloring ofP5-free gra

Effective on-line coloring ofP5-free graphs

✍ András Gyárfás; Jenő Lehel 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 235 KB

On-line coloring of perfect graphs

✍ H. A. Kierstead; K. Kolossa 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 655 KB

On-line coloring and cliques covering fo

On-line coloring and cliques covering for KKs,t-free graphs

✍ Iwona Cieślik 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 948 KB

On-line and first fit colorings of graph

On-line and first fit colorings of graphs

✍ A. Gyárfás; J. Lehel 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 537 KB

A graph coloring algorithm that immediately colors the vertices taken from a list without looking ahead or changing colors already assigned is called "on-line coloring." The properties of on-line colorings are investigated in several classes of graphs. In many cases w e find on-line colorings that u

On α-redundant vertices in P5-free graph

On α-redundant vertices in P5-free graphs

✍ Andreas Brandstädt; Hoàng-Oanh Le; Van Bang Le 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 73 KB

On 3-colorings of bipartite p-threshold

On 3-colorings of bipartite p-threshold graphs

✍ Ioan Tomescu 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 510 KB