Huang, Fei; Li, Xueliang; Qin, Zhongmei; Magnant, Colton Minimum degree condition for proper connection number 2. (English) Zbl 1428.05109 Theor. Comput. Sci. 774, 44-50 (2019). MSC: 05C15 05C38 05C07 05C35 PDFBibTeX XMLCite \textit{F. Huang} et al., Theor. Comput. Sci. 774, 44--50 (2019; Zbl 1428.05109) Full Text: DOI
Bang-Jensen, Jørgen; Bessy, Stéphane Degree-constrained 2-partitions of graphs. (English) Zbl 1427.68226 Theor. Comput. Sci. 776, 64-74 (2019). Reviewer: Vladimír Lacko (Košice) MSC: 68R10 05C70 68Q25 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{S. Bessy}, Theor. Comput. Sci. 776, 64--74 (2019; Zbl 1427.68226) Full Text: DOI arXiv Link
Bang-Jensen, Jørgen; Christiansen, Tilde My Degree constrained 2-partitions of semicomplete digraphs. (English) Zbl 1401.05129 Theor. Comput. Sci. 746, 112-123 (2018). MSC: 05C20 05C70 68Q25 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{T. M. Christiansen}, Theor. Comput. Sci. 746, 112--123 (2018; Zbl 1401.05129) Full Text: DOI
Kobayashi, Yusuke NP-hardness and fixed-parameter tractability of the minimum spanner problem. (English) Zbl 1401.68098 Theor. Comput. Sci. 746, 88-97 (2018). MSC: 68Q17 05C85 68R10 PDFBibTeX XMLCite \textit{Y. Kobayashi}, Theor. Comput. Sci. 746, 88--97 (2018; Zbl 1401.68098) Full Text: DOI Link
Cao, Huabin; Zhang, Bicheng; Zhou, Zhiheng One-to-one disjoint path covers in digraphs. (English) Zbl 1387.05192 Theor. Comput. Sci. 714, 27-35 (2018). MSC: 05C70 05C38 05C20 05C07 05C35 PDFBibTeX XMLCite \textit{H. Cao} et al., Theor. Comput. Sci. 714, 27--35 (2018; Zbl 1387.05192) Full Text: DOI
Bang-Jensen, J.; Cohen, Nathann; Havet, Frédéric Finding good 2-partitions of digraphs. II. Enumerable properties. (English) Zbl 1345.68168 Theor. Comput. Sci. 640, 1-19 (2016). MSC: 68Q25 05C20 05C70 68Q17 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Theor. Comput. Sci. 640, 1--19 (2016; Zbl 1345.68168) Full Text: DOI
Bang-Jensen, J.; Havet, Frédéric Finding good 2-partitions of digraphs. I. Hereditary properties. (English) Zbl 1342.68150 Theor. Comput. Sci. 636, 85-94 (2016). MSC: 68Q25 05C20 05C70 68Q17 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{F. Havet}, Theor. Comput. Sci. 636, 85--94 (2016; Zbl 1342.68150) Full Text: DOI
Xu, Hongli; Huang, Liusheng; Liu, Wang; Zhang, Yindong; Sun, Yanjing Degree-bounded minimum spanning tree for unit disk graph. (English) Zbl 1236.68014 Theor. Comput. Sci. 418, 92-105 (2012). MSC: 68M10 68R10 68M14 05C05 PDFBibTeX XMLCite \textit{H. Xu} et al., Theor. Comput. Sci. 418, 92--105 (2012; Zbl 1236.68014) Full Text: DOI
Mezzini, Mauro Fast minimal triangulation algorithm using minimum degree criterion. (English) Zbl 1220.05121 Theor. Comput. Sci. 412, No. 29, 3775-3787 (2011). MSC: 05C85 05C70 PDFBibTeX XMLCite \textit{M. Mezzini}, Theor. Comput. Sci. 412, No. 29, 3775--3787 (2011; Zbl 1220.05121) Full Text: DOI
Berry, Anne; Dahlhaus, Elias; Heggernes, Pinar; Simonet, Geneviève Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree. (English) Zbl 1155.68088 Theor. Comput. Sci. 409, No. 3, 601-616 (2008). MSC: 68W10 PDFBibTeX XMLCite \textit{A. Berry} et al., Theor. Comput. Sci. 409, No. 3, 601--616 (2008; Zbl 1155.68088) Full Text: DOI
Li, H.; Li, Jianping Independent triangles covering given vertices of a graph. (English) Zbl 0972.05039 Theor. Comput. Sci. 263, No. 1-2, 333-344 (2001). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{H. Li} and \textit{J. Li}, Theor. Comput. Sci. 263, No. 1--2, 333--344 (2001; Zbl 0972.05039) Full Text: DOI