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
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs
(2009)
Presentation / Conference Contribution
Three complexity results on coloring Pk-free graphs
(2009)
Presentation / Conference Contribution
The computational complexity of the parallel knock-out problem
(2006)
Presentation / Conference Contribution
On hamiltonicity of P3-dominated graphs
(2009)
Journal Article
Upper bounds and algorithms for parallel knock-out numbers
(2009)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search