𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coloring planar perfect graphs by decomposition

✍ Scribed by W. -L. Hsu

Book ID
110564311
Publisher
Springer-Verlag
Year
1986
Tongue
English
Weight
282 KB
Volume
6
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Coloring perfect degenerate graphs
Coloring perfect degenerate graphs
✍ HacΓ¨ne AΓ―t HaddadΓ¨ne; FrΓ©dΓ©ric Maffray πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 257 KB
Coloring precolored perfect graphs
Coloring precolored perfect graphs
✍ KratochvοΏ½l, Jan; Seb?, AndrοΏ½s πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 115 KB πŸ‘ 2 views

We consider the question of the computational complexity of coloring perfect graphs with some precolored vertices. It is well known that a perfect graph can be colored optimally in polynomial time. Our results give a sharp border between the polynomial and NP-complete instances, when precolored vert

Coloring Planar Toeplitz Graphs
Coloring Planar Toeplitz Graphs
✍ Reinhardt Euler πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 244 KB
Coloring Bull-Free Perfect Graphs
Coloring Bull-Free Perfect Graphs
✍ Penev, Irena πŸ“‚ Article πŸ“… 2012 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 359 KB