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
β¦ LIBER β¦
Perfect Circular Arc Coloring
β Scribed by Xujin Chen; Zhiquan Hu; Wenan Zang
- Book ID
- 106406966
- Publisher
- Springer US
- Year
- 2005
- Tongue
- English
- Weight
- 569 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1382-6905
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Coloring precolored perfect graphs
β
KratochvοΏ½l, Jan; Seb?, AndrοΏ½s
π
Article
π
1997
π
John Wiley and Sons
π
English
β 115 KB
π 2 views
Coloring perfect degenerate graphs
β
Hacène Aït Haddadène; Frédéric Maffray
π
Article
π
1997
π
Elsevier Science
π
English
β 257 KB
Revisiting Tucker's Algorithm to Color C
β
Mario E. Valencia-Pabon
π
Article
π
2001
π
Elsevier Science
π
English
β 292 KB
Past Perfect (ARC)
β
Sales, Leila
π
Fiction
π
English
β 8 MB
β
Walters, A. Meredith
π
Fiction
π
2013
π
Amazon Digital Services, Inc.
π
English
β 370 KB
**[This is an Advanced Reader Copy.]** The spin off of the New York Times bestseller, Bad Rep. Can be read as a stand alone! * * * Riley Walker makes all the right decisions and knows exactly where her life is headed. Riley Walker does not make mistakes. Riley Walker certainly doesnβt
Coloring Fuzzy Circular Interval Graphs
β
Friedrich Eisenbrand; Martin Niemeier
π
Article
π
2009
π
Elsevier Science
π
English
β 174 KB