Li, Binlong; Ning, Bo A strengthening of Erdős-Gallai theorem and proof of Woodall’s conjecture. (English) Zbl 1457.05057 J. Comb. Theory, Ser. B 146, 76-95 (2021). MSC: 05C38 05C12 PDF BibTeX XML Cite \textit{B. Li} and \textit{B. Ning}, J. Comb. Theory, Ser. B 146, 76--95 (2021; Zbl 1457.05057) Full Text: DOI arXiv OpenURL
Salamon, Gábor Vulnerability bounds on the number of spanning tree leaves. (English) Zbl 1207.05203 Ars Math. Contemp. 2, No. 1, 77-92 (2009). MSC: 05C85 05C40 05C45 PDF BibTeX XML Cite \textit{G. Salamon}, Ars Math. Contemp. 2, No. 1, 77--92 (2009; Zbl 1207.05203) Full Text: DOI OpenURL
Ramachandran, S.; Parvathy, R. Covering vertices with cycles. (English) Zbl 0785.05060 Mathai, A. M. (ed.), Proceedings of the symposium on graph theory and combinatorics, held on 17-19 May, 1991 at Kochi, Kerala, India. Trivandrum: Centre for Mathematical Sciences, Publ., Cent. Math. Sci., Trivandrum. 21, 57-66 (1991). MSC: 05C38 05C45 PDF BibTeX XML Cite \textit{S. Ramachandran} and \textit{R. Parvathy}, in: Proceedings of the symposium on graph theory and combinatorics, held on 17-19 May, 1991 at Kochi, Kerala, India. Trivandrum: Centre for Mathematical Sciences. 57--66 (1991; Zbl 0785.05060) OpenURL
Takamizawa, K.; Nishizeki, T.; Saito, N. An algorithm for finding a short closed spanning walk in a graph. (English) Zbl 0443.05057 Networks 10, 249-263 (1980). MSC: 05C45 05-04 PDF BibTeX XML Cite \textit{K. Takamizawa} et al., Networks 10, 249--263 (1980; Zbl 0443.05057) Full Text: DOI OpenURL