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
✦ LIBER ✦
Extending partial 5-colorings and 6-colorings in planar graphs
✍ Scribed by Daniel Král
- Book ID
- 108167391
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 180 KB
- Volume
- 96
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Extending colorings of locally planar gr
✍
Michael O. Albertson; Joan P. Hutchinson
📂
Article
📅
2001
🏛
John Wiley and Sons
🌐
English
⚖ 112 KB
👁 1 views
Planar graphs with maximum degree 7 and
✍
Lan Shen; Yingqian Wang
📂
Article
📅
2010
🏛
Elsevier Science
🌐
English
⚖ 460 KB
Alternating walks in partially 2-edge-co
✍
AndréE. Kézdy; Chi Wang
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 292 KB
A graph is partially 2-edge-colored if edges of G are colored by two colors, possibly with some edges uncolored. A walk is alternating in a partially 2-edge-colored graph if the given 2edge-coloring can be extended to all edges of G such that colors alternate as the walk is traversed. We present a p
List 2-distance (Δ + 2)-coloring of plan
✍
Oleg V. Borodin; Anna O. Ivanova
📂
Article
📅
2009
🏛
SP MAIK Nauka/Interperiodica
🌐
English
⚖ 167 KB
On the 7 Total Colorability of Planar Gr
✍
Lan Shen; Yingqian Wang
📂
Article
📅
2009
🏛
Springer Japan
🌐
English
⚖ 168 KB
Structure of neighborhoods of edges in p
✍
O. V. Borodin
📂
Article
📅
1993
🏛
SP MAIK Nauka/Interperiodica
🌐
English
⚖ 667 KB