𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coloring algorithms for K5-minor free graphs

✍ Scribed by Samir Khuller

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
590 KB
Volume
34
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Choosability of K5-minor-free graphs
Choosability of K5-minor-free graphs
✍ Riste SΛ‡krekovski πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 153 KB

Thomassen, 1994 showed that all planar graphs are 5-choosable. In this paper we extend this result, by showing that all Ks-minor-free graphs are 5-choosable. (~) 1998 Elsevier Science B.V.

List Colorings of K5-Minor-Free Graphs W
List Colorings of K5-Minor-Free Graphs With Special List Assignments
✍ Daniel W. Cranston; Anja Pruchnewski; Zsolt Tuza; Margit Voigt πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 201 KB

The following question was raised by Bruce Richter. Let G be a planar, 3-connected graph that is not a complete graph. Denoting by d(v) the degree of vertex v, is G L-list colorable for every list assignment L with |L(v)|=min{d(v), 6} for all v ∈ V (G)? More generally, we ask for which pairs (r, k)

Algorithms for coloring semi-random grap
Algorithms for coloring semi-random graphs
✍ C. R. Subramanian; Martin FΓΌrer; C. E. Veni Madhavan πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 373 KB πŸ‘ 3 views

The graph coloring problem is to color a given graph with the minimum number of colors. This problem is known to be NP-hard even if we are only aiming at approximate solutions. On the other hand, the best known approximation algorithms require ␦ Ž . Ž . n ␦ ) 0 colors even for bounded chromatic k-co

Precoloring extension for K4-minor-free
Precoloring extension for K4-minor-free graphs
✍ Anja Pruchnewski; Margit Voigt πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 230 KB πŸ‘ 1 views

## Abstract Let __G__=(__V, E__) be a graph where every vertex __v__∈__V__ is assigned a list of available colors __L__(__v__). We say that __G__ is list colorable for a given list assignment if we can color every vertex using its list such that adjacent vertices get different colors. If __L__(__v_