𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extending partial colorings of graphs

✍ Scribed by H.A. Kierstead

Book ID
108316445
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
85 KB
Volume
219
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Extending colorings of locally planar gr
Extending colorings of locally planar graphs
✍ Michael O. Albertson; Joan P. Hutchinson πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 112 KB πŸ‘ 1 views

Suppose G is a graph embedded in S g with width (also known as edge width) at least 264(2 g Γ€ 1). If P V(G) is such that the distance between any two vertices in P is at least 16, then any 5-coloring of P extends to a 5-coloring of all of G. We present similar extension theorems for 6-and 7-chromati

Extending Graph Colorings
Extending Graph Colorings
✍ Michael O Albertson; Emily H Moore πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 172 KB

Suppose /(G)=r and P V(G). It is known that if the distance between any two vertices in P is at least 4, then any (r+1)-coloring of P extends to an (r+1)-coloring of all of G, but an r-coloring of P might not extend to an r-coloring of G. We show that if the distance between any two vertices in P is