Tankus, David; Tarsi, Michael Greedily constructing maximal partial \(f\)-factors. (English) Zbl 1214.05133 Discrete Math. 309, No. 8, 2180-2189 (2009). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{D. Tankus} and \textit{M. Tarsi}, Discrete Math. 309, No. 8, 2180--2189 (2009; Zbl 1214.05133) Full Text: DOI
Tankus, David; Tarsi, Michael Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests. (English) Zbl 1117.05074 Discrete Math. 307, No. 15, 1833-1843 (2007). MSC: 05C45 PDFBibTeX XMLCite \textit{D. Tankus} and \textit{M. Tarsi}, Discrete Math. 307, No. 15, 1833--1843 (2007; Zbl 1117.05074) Full Text: DOI
Tankus, David; Tarsi, Michael The structure of well-covered graphs and the complexity of their recognition problems. (English) Zbl 0873.05074 J. Comb. Theory, Ser. B 69, No. 2, 230-233 (1997). Reviewer: Z.Chen (Indianapolis) MSC: 05C85 68R10 PDFBibTeX XMLCite \textit{D. Tankus} and \textit{M. Tarsi}, J. Comb. Theory, Ser. B 69, No. 2, 230--233 (1997; Zbl 0873.05074) Full Text: DOI