Ferhat, Dehia Ait; Király, Zoltán; Sebő, András; Stauffer, Gautier How many matchings cover the nodes of a graph? (English) Zbl 07807861 Math. Program. 203, No. 1-2 (B), 271-284 (2024). MSC: 90C27 05C70 05C85 PDFBibTeX XMLCite \textit{D. A. Ferhat} et al., Math. Program. 203, No. 1--2 (B), 271--284 (2024; Zbl 07807861) Full Text: DOI arXiv
Xi, Wenying; Lin, Wensong The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices. (English) Zbl 07796522 Graphs Comb. 40, No. 1, Paper No. 5, 26 p. (2024). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{W. Xi} and \textit{W. Lin}, Graphs Comb. 40, No. 1, Paper No. 5, 26 p. (2024; Zbl 07796522) Full Text: DOI
Xi, Wenying; Lin, Wensong; Lin, Yuquan Packing 2- and 3-stars into cubic graphs. (English) Zbl 07748299 Appl. Math. Comput. 460, Article ID 128287, 10 p. (2024). MSC: 05Cxx 68Qxx 68Rxx PDFBibTeX XMLCite \textit{W. Xi} et al., Appl. Math. Comput. 460, Article ID 128287, 10 p. (2024; Zbl 07748299) Full Text: DOI
Lonc, Zbigniew; Petryshyn, Nataliya Edge decompositions and rooted packings of graphs. (English) Zbl 1504.05235 Discrete Math. 345, No. 12, Article ID 113057, 18 p. (2022). Reviewer: Zan-Bo Zhang (Guangzhou) MSC: 05C70 05C75 68Q25 PDFBibTeX XMLCite \textit{Z. Lonc} and \textit{N. Petryshyn}, Discrete Math. 345, No. 12, Article ID 113057, 18 p. (2022; Zbl 1504.05235) Full Text: DOI
Swenson, Krister M.; Elghraoui, Afif; Valafar, Faramarz; Mirarab, Siavash; Weller, Mathias Quantifying hierarchical conflicts in homology statements. (English) Zbl 1496.92054 Jin, Lingling (ed.) et al., Comparative genomics. 19th international conference, RECOMB-CG 2022, La Jolla, CA, USA, May 20–21, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13234, 146-167 (2022). MSC: 92D10 92D20 PDFBibTeX XMLCite \textit{K. M. Swenson} et al., Lect. Notes Comput. Sci. 13234, 146--167 (2022; Zbl 1496.92054) Full Text: DOI
Xi, Wenying; Lin, Wensong On maximum \(P_3\)-packing in claw-free subcubic graphs. (English) Zbl 1464.05310 J. Comb. Optim. 41, No. 3, 694-709 (2021). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{W. Xi} and \textit{W. Lin}, J. Comb. Optim. 41, No. 3, 694--709 (2021; Zbl 1464.05310) Full Text: DOI
Bujtás, Csilla; Jendroľ, Stanislav; Tuza, Zsolt On caterpillar factors in graphs. (English) Zbl 1464.68276 Theor. Comput. Sci. 846, 82-90 (2020). MSC: 68R10 05C70 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{C. Bujtás} et al., Theor. Comput. Sci. 846, 82--90 (2020; Zbl 1464.68276) Full Text: DOI
Bar-Noy, Amotz; Peleg, David; Rabanca, George; Vigan, Ivo Improved approximation algorithms for weighted 2-path partitions. (English) Zbl 1382.05056 Discrete Appl. Math. 239, 15-37 (2018). MSC: 05C70 05C38 68W25 PDFBibTeX XMLCite \textit{A. Bar-Noy} et al., Discrete Appl. Math. 239, 15--37 (2018; Zbl 1382.05056) Full Text: DOI
Bar-Noy, Amotz; Peleg, David; Rabanca, George; Vigan, Ivo Improved approximation algorithms for weighted 2-path partitions. (English) Zbl 1466.05175 Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9294, 953-964 (2015). MSC: 05C70 05C22 05C38 68W25 68Q25 PDFBibTeX XMLCite \textit{A. Bar-Noy} et al., Lect. Notes Comput. Sci. 9294, 953--964 (2015; Zbl 1466.05175) Full Text: DOI
Kelmans, Alexander Packing 3-vertex paths in claw-free graphs and related topics. (English) Zbl 1206.05058 Discrete Appl. Math. 159, No. 2-3, 112-127 (2011). MSC: 05C38 05C70 05C83 PDFBibTeX XMLCite \textit{A. Kelmans}, Discrete Appl. Math. 159, No. 2--3, 112--127 (2011; Zbl 1206.05058) Full Text: DOI arXiv
Lonc, Zbigniew; Pszczoła, Monika Edge decompositions into two kinds of graphs. (English) Zbl 1210.05111 Discrete Math. 309, No. 22, 6368-6374 (2009). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{Z. Lonc} and \textit{M. Pszczoła}, Discrete Math. 309, No. 22, 6368--6374 (2009; Zbl 1210.05111) Full Text: DOI
Brewster, Richard C.; Hell, Pavol; Rizzi, Romeo Oriented star packings. (English) Zbl 1139.05027 J. Comb. Theory, Ser. B 98, No. 3, 558-576 (2008). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C20 05C70 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., J. Comb. Theory, Ser. B 98, No. 3, 558--576 (2008; Zbl 1139.05027) Full Text: DOI
Plummer, Michael D. Graph factors and factorization: 1985–2003: a survey. (English) Zbl 1112.05088 Discrete Math. 307, No. 7-8, 791-821 (2007). MSC: 05C70 05-02 PDFBibTeX XMLCite \textit{M. D. Plummer}, Discrete Math. 307, No. 7--8, 791--821 (2007; Zbl 1112.05088) Full Text: DOI
Prieto, Elena; Sloper, Christian Looking at the stars. (English) Zbl 1087.68076 Theor. Comput. Sci. 351, No. 3, 437-445 (2006). MSC: 68R10 68W05 PDFBibTeX XMLCite \textit{E. Prieto} and \textit{C. Sloper}, Theor. Comput. Sci. 351, No. 3, 437--445 (2006; Zbl 1087.68076) Full Text: DOI
MacGillivray, Gary; Yu, Min-Li Generalized partitions of graphs. (English) Zbl 0917.05056 Discrete Appl. Math. 91, No. 1-3, 143-153 (1999). Reviewer: Guojun Li (Jinan) MSC: 05C70 05C15 05C85 68R10 PDFBibTeX XMLCite \textit{G. MacGillivray} and \textit{M.-L. Yu}, Discrete Appl. Math. 91, No. 1--3, 143--153 (1999; Zbl 0917.05056) Full Text: DOI
Lingas, Andrzej Maximum tree-packing in time \(O(n^{5/2})\). (English) Zbl 0901.68150 Theor. Comput. Sci. 181, No. 2, 307-316 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{A. Lingas}, Theor. Comput. Sci. 181, No. 2, 307--316 (1997; Zbl 0901.68150) Full Text: DOI
Kelmans, Alexander K. Optimal packing of induced stars in a graph. (English) Zbl 0887.05041 Discrete Math. 173, No. 1-3, 97-127 (1997). Reviewer: B.Alspach (Burnaby) MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{A. K. Kelmans}, Discrete Math. 173, No. 1--3, 97--127 (1997; Zbl 0887.05041) Full Text: DOI
Hell, Pavol; Kirkpatrick, David; Li, Brenda Rounding in symmetric matrices and undirected graphs. (English) Zbl 0920.05062 Discrete Appl. Math. 70, No. 1, 1-21 (1996). MSC: 05C85 05C50 05C70 68R10 05C38 05C05 PDFBibTeX XMLCite \textit{P. Hell} et al., Discrete Appl. Math. 70, No. 1, 1--21 (1996; Zbl 0920.05062) Full Text: DOI
Lonc, Zbigniew On the complexity of some edge-partition problems for graphs. (English) Zbl 0860.05061 Discrete Appl. Math. 70, No. 2, 177-183 (1996). Reviewer: W.K.Chen (Chicago) MSC: 05C70 68R10 PDFBibTeX XMLCite \textit{Z. Lonc}, Discrete Appl. Math. 70, No. 2, 177--183 (1996; Zbl 0860.05061) Full Text: DOI Link
Lingas, Andrzej Maximum tree-packing in time \(O(n^{5/2})\). (English) Zbl 1527.68165 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 1st international conference, COCOON ’95, Xi’an, China, August 24–26, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 959, 121-130 (1995). MSC: 68R10 05C05 05C70 68Q25 PDFBibTeX XMLCite \textit{A. Lingas}, Lect. Notes Comput. Sci. 959, 121--130 (1995; Zbl 1527.68165) Full Text: DOI
Masuyama, Shigeru On the tree packing problem. (English) Zbl 0739.05072 Discrete Appl. Math. 35, No. 2, 163-166 (1992). MSC: 05C70 05C05 05C85 PDFBibTeX XMLCite \textit{S. Masuyama}, Discrete Appl. Math. 35, No. 2, 163--166 (1992; Zbl 0739.05072) Full Text: DOI
de Werra, Dominique; Roberts, F. S. On the use of augmenting chains in chain packings. (English) Zbl 0763.05086 Discrete Appl. Math. 30, No. 2-3, 137-149 (1991). MSC: 05C70 05B35 05C05 PDFBibTeX XMLCite \textit{D. de Werra} and \textit{F. S. Roberts}, Discrete Appl. Math. 30, No. 2--3, 137--149 (1991; Zbl 0763.05086) Full Text: DOI
Masuyama, Shigeru; Ibaraki, Toshihide Chain packing in graphs. (English) Zbl 0731.68088 Algorithmica 6, No. 6, 826-839 (1991). MSC: 68R10 68Q25 05C85 PDFBibTeX XMLCite \textit{S. Masuyama} and \textit{T. Ibaraki}, Algorithmica 6, No. 6, 826--839 (1991; Zbl 0731.68088) Full Text: DOI
Favaron, O.; Heydemann, M. C.; Meyer, J. C.; Sotteau, D. A parameter linked with \(G\)-factors and the binding number. (English) Zbl 0756.05067 Discrete Math. 91, No. 3, 311-316 (1991). MSC: 05C35 05C99 05C70 PDFBibTeX XMLCite \textit{O. Favaron} et al., Discrete Math. 91, No. 3, 311--316 (1991; Zbl 0756.05067) Full Text: DOI
Loebl, Martin; Poljak, Svatopluk On matroids induced by packing subgraphs. (English) Zbl 0655.05054 J. Comb. Theory, Ser. B 44, No. 3, 338-354 (1988). Reviewer: F.Komjáth MSC: 05C99 05B35 05C10 05C70 PDFBibTeX XMLCite \textit{M. Loebl} and \textit{S. Poljak}, J. Comb. Theory, Ser. B 44, No. 3, 338--354 (1988; Zbl 0655.05054) Full Text: DOI
Loebl, Martin; Poljak, Svatopluk On the union of matching matroids. (English) Zbl 0786.05019 Math. Slovaca 38, No. 4, 301-303 (1988). MSC: 05B35 05C99 PDFBibTeX XMLCite \textit{M. Loebl} and \textit{S. Poljak}, Math. Slovaca 38, No. 4, 301--303 (1988; Zbl 0786.05019) Full Text: EuDML
Hell, P.; Kirkpatrick, D. G. Packings by cliques and by finite families of graphs. (English) Zbl 0582.05046 Discrete Math. 49, 45-59 (1984). MSC: 05C70 05C35 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. G. Kirkpatrick}, Discrete Math. 49, 45--59 (1984; Zbl 0582.05046) Full Text: DOI Backlinks: MO