Li, Yanjun; Szabó, Jácint An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem. (English) Zbl 1439.05191 Electron. J. Comb. 27, No. 1, Research Paper P1.15, 17 p. (2020). Reviewer: Sizhong Zhou (Zhenjiang) MSC: 05C70 90C27 68Q17 PDFBibTeX XMLCite \textit{Y. Li} and \textit{J. Szabó}, Electron. J. Comb. 27, No. 1, Research Paper P1.15, 17 p. (2020; Zbl 1439.05191) Full Text: DOI Link
Hartvigsen, David Packing \(k\)-matchings and \(k\)-critical graphs. (English) Zbl 1379.05088 SIAM J. Discrete Math. 32, No. 1, 320-351 (2018). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{D. Hartvigsen}, SIAM J. Discrete Math. 32, No. 1, 320--351 (2018; Zbl 1379.05088) Full Text: DOI
Bérczi, Kristóf; Bernáth, Attila; Vizer, Máté A note on \({\mathtt V}\)-free 2-matchings. (English) Zbl 1351.05195 Electron. J. Comb. 23, No. 4, Research Paper P4.27, 9 p. (2016). MSC: 05C78 05C65 05C70 68Q17 PDFBibTeX XMLCite \textit{K. Bérczi} et al., Electron. J. Comb. 23, No. 4, Research Paper P4.27, 9 p. (2016; Zbl 1351.05195) Full Text: arXiv Link
Lepin, V. V. Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph. (Russian. English summary) Zbl 1462.05301 Tr. Inst. Mat., Minsk 22, No. 1, 78-97 (2014). MSC: 05C70 05C22 PDFBibTeX XMLCite \textit{V. V. Lepin}, Tr. Inst. Mat., Minsk 22, No. 1, 78--97 (2014; Zbl 1462.05301) Full Text: MNR
Li, Yanjun The nonnegative node weight \(j\)-restricted \(k\)-matching problems. (English) Zbl 1309.90088 Math. Oper. Res. 39, No. 3, 930-948 (2014). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{Y. Li}, Math. Oper. Res. 39, No. 3, 930--948 (2014; Zbl 1309.90088) Full Text: DOI
Binkele-Raible, Daniel; Fernau, Henning Packing paths: recycling saves time. (English) Zbl 1287.05112 Discrete Appl. Math. 161, No. 12, 1686-1698 (2013). MSC: 05C70 05C38 05C35 05C85 PDFBibTeX XMLCite \textit{D. Binkele-Raible} and \textit{H. Fernau}, Discrete Appl. Math. 161, No. 12, 1686--1698 (2013; Zbl 1287.05112) Full Text: DOI
Janata, Marek; Szabó, Jácint The superstar packing problem. (English) Zbl 1517.05142 Combinatorica 29, No. 1, 27-48 (2009). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{M. Janata} and \textit{J. Szabó}, Combinatorica 29, No. 1, 27--48 (2009; Zbl 1517.05142) Full Text: DOI
Zhang, Heping; Zhou, Shan Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs. (English) Zbl 1205.05187 Discrete Math. 309, No. 8, 2067-2076 (2009). MSC: 05C70 PDFBibTeX XMLCite \textit{H. Zhang} and \textit{S. Zhou}, Discrete Math. 309, No. 8, 2067--2076 (2009; Zbl 1205.05187) Full Text: DOI
Szabó, Jácint Packing trees with constraints on the leaf degree. (English) Zbl 1169.05045 Graphs Comb. 24, No. 5, 485-494 (2008). MSC: 05C70 05C05 PDFBibTeX XMLCite \textit{J. Szabó}, Graphs Comb. 24, No. 5, 485--494 (2008; Zbl 1169.05045) Full Text: DOI
Janata, Marek About a new class of matroid-inducing packing families. (English) Zbl 1118.05080 Discrete Math. 307, No. 16, 2002-2007 (2007). MSC: 05C70 PDFBibTeX XMLCite \textit{M. Janata}, Discrete Math. 307, No. 16, 2002--2007 (2007; Zbl 1118.05080) Full Text: DOI
Cameron, Kathie; Hell, Pavol Independent packings in structured graphs. (English) Zbl 1078.05067 Math. Program. 105, No. 2-3 (B), 201-213 (2006). MSC: 05C70 PDFBibTeX XMLCite \textit{K. Cameron} and \textit{P. Hell}, Math. Program. 105, No. 2--3 (B), 201--213 (2006; Zbl 1078.05067) Full Text: DOI
Kano, M.; Katona, G. Y.; Király, Z. Packing paths of length at least two. (English) Zbl 1042.05084 Discrete Math. 283, No. 1-3, 129-135 (2004). MSC: 05C70 05C38 PDFBibTeX XMLCite \textit{M. Kano} et al., Discrete Math. 283, No. 1--3, 129--135 (2004; Zbl 1042.05084) Full Text: DOI
Tóth, Csaba D. Illuminating disjoint line segments in the plane. (English) Zbl 1048.52013 Discrete Comput. Geom. 30, No. 3, 489-505 (2003). Reviewer: Horst Martini (Chemnitz) MSC: 52C45 52A10 52A37 PDFBibTeX XMLCite \textit{C. D. Tóth}, Discrete Comput. Geom. 30, No. 3, 489--505 (2003; Zbl 1048.52013) Full Text: DOI