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
Schmand, Daniel; Schröder, Marc; Vargas Koch, Laura A greedy algorithm for the social golfer and the Oberwolfach problem. (English) Zbl 1495.05267 Eur. J. Oper. Res. 300, No. 1, 310-319 (2022). MSC: 05C70 05C38 90B35 90C27 05C85 PDFBibTeX XMLCite \textit{D. Schmand} et al., Eur. J. Oper. Res. 300, No. 1, 310--319 (2022; Zbl 1495.05267) Full Text: DOI arXiv
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
Duchêne, Eric; Gledel, Valentin; Parreau, Aline; Renault, Gabriel Maker-Breaker domination game. (English) Zbl 1443.05126 Discrete Math. 343, No. 9, Article ID 111955, 11 p. (2020). MSC: 05C57 05C69 91A43 91A05 05C05 PDFBibTeX XMLCite \textit{E. Duchêne} et al., Discrete Math. 343, No. 9, Article ID 111955, 11 p. (2020; Zbl 1443.05126) Full Text: DOI arXiv
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
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
Aziz, Haris; Brandt, Felix; Harrenstein, Paul Pareto optimality in coalition formation. (English) Zbl 1283.91011 Games Econ. Behav. 82, 562-581 (2013). MSC: 91A12 91B32 91B68 PDFBibTeX XMLCite \textit{H. Aziz} et al., Games Econ. Behav. 82, 562--581 (2013; Zbl 1283.91011) Full Text: DOI
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
Nešetřil, Jaroslav A surprising permanence of old motivations (a not-so-rigid story). (English) Zbl 1183.01032 Discrete Math. 309, No. 18, 5510-5526 (2009). Reviewer: Antonín Slavík (Praha) MSC: 01A70 05-02 05-03 05C75 PDFBibTeX XMLCite \textit{J. Nešetřil}, Discrete Math. 309, No. 18, 5510--5526 (2009; Zbl 1183.01032) Full Text: DOI
Chataigner, F.; Manić, G.; Wakabayashi, Y.; Yuster, R. Approximation algorithms and hardness results for the clique packing problem. (English) Zbl 1172.05046 Discrete Appl. Math. 157, No. 7, 1396-1406 (2009). MSC: 05C69 05C70 05C85 PDFBibTeX XMLCite \textit{F. Chataigner} et al., Discrete Appl. Math. 157, No. 7, 1396--1406 (2009; Zbl 1172.05046) 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
Chataigner, F.; Manić, G.; Wakabayashi, Y.; Yuster, R. Approximation algorithms and hardness results for the clique packing problem. (English) Zbl 1341.05204 Márquez, Alberto (ed.) et al., Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb’07, Seville, Spain, September 11–15, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 29, 397-401 (2007). MSC: 05C70 05C69 05C85 68W25 PDFBibTeX XMLCite \textit{F. Chataigner} et al., Electron. Notes Discrete Math. 29, 397--401 (2007; Zbl 1341.05204) 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
Brewster, Richard C.; Rizzi, Romeo On the complexity of digraph packings. (English) Zbl 1173.68528 Inf. Process. Lett. 86, No. 2, 101-106 (2003). MSC: 68Q17 68R10 PDFBibTeX XMLCite \textit{R. C. Brewster} and \textit{R. Rizzi}, Inf. Process. Lett. 86, No. 2, 101--106 (2003; Zbl 1173.68528) 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
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
Lonc, Zbigniew Chain partitions of ordered sets. (English) Zbl 0816.06004 Order 11, No. 4, 343-351 (1994). MSC: 06A07 68R05 68Q25 PDFBibTeX XMLCite \textit{Z. Lonc}, Order 11, No. 4, 343--351 (1994; Zbl 0816.06004) 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
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 complete bipartite graphs. (English) Zbl 0597.05050 SIAM J. Algebraic Discrete Methods 7, 199-209 (1986). MSC: 05C70 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. G. Kirkpatrick}, SIAM J. Algebraic Discrete Methods 7, 199--209 (1986; Zbl 0597.05050) Full Text: DOI
Lai, Ten-Hwang; Sprague, Alan On the complexity of a family of generalized matching problems. (English) Zbl 0582.68014 Discrete Appl. Math. 12, 303-318 (1985). MSC: 68Q25 05C70 PDFBibTeX XMLCite \textit{T.-H. Lai} and \textit{A. Sprague}, Discrete Appl. Math. 12, 303--318 (1985; Zbl 0582.68014) Full Text: DOI