Xueliang Li
Complexity of conditional colorability of graphs
Li, Xueliang; Yao, Xiangmei; Zhou, Wenli; Broersma, Hajo
Authors
Xiangmei Yao
Wenli Zhou
Hajo Broersma
Citation
Li, X., Yao, X., Zhou, W., & Broersma, H. (2009). Complexity of conditional colorability of graphs. Applied Mathematics Letters, 22(3), 320-324. https://doi.org/10.1016/j.aml.2008.04.003
| Journal Article Type | Article |
|---|---|
| Publication Date | Mar 1, 2009 |
| Deposit Date | Apr 17, 2009 |
| Journal | Applied Mathematics Letters |
| Print ISSN | 0893-9659 |
| Publisher | Elsevier |
| Peer Reviewed | Peer Reviewed |
| Volume | 22 |
| Issue | 3 |
| Pages | 320-324 |
| DOI | https://doi.org/10.1016/j.aml.2008.04.003 |
| Public URL | https://durham-repository.worktribe.com/output/1559364 |
You might also like
On hamiltonicity of P3-dominated graphs
(2009)
Journal Article
Upper bounds and algorithms for parallel knock-out numbers
(2009)
Journal Article
Sharp upper bounds for the minimum number of components of 2-factors in claw-free graphs
(2009)
Journal Article
More about subcolorings
(2002)
Journal Article
Radio labeling with preassigned frequencies
(2004)
Journal Article