Discussiones Mathematicae Graph Theory > 2015 > 35 > 3 > 427-437
Source
Abstract
Identifiers
journal ISSN : | 2083-5892 |
DOI | 10.7151/dmgt.1806 |
Authors
Keywords
Additional information
Publisher
Fields of science
Bibliography
-
[1] T. Araki, Dirac’s condition for completely independent spanning trees, J. Graph Theory 77 (2014) 171-179. doi:10.1002/jgt.21780[WoS][Crossref]
-
[2] S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Appl. Math. 23 (1989) 11-24. doi:10.1016/0166-218X(89)90031-0[Crossref]
-
[3] H.L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoret. Comput. Sci. 209 (1998) 1-45. doi:10.1016/S0304-3975(97)00228-4[Crossref]