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 |
You might also like
Fully decomposable split graphs
(2009)
Conference Proceeding
On hamiltonicity of P3-dominated graphs
(2009)
Journal Article
Upper bounds and algorithms for parallel knock-out numbers
(2009)
Journal Article
Planar graph coloring avoiding monochromatic subgraphs : trees and paths make it difficult
(2006)
Journal Article
Global connectivity and expansion : long cycles and factors in f-connected graphs
(2006)
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