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
Pak, Igor; Yang, Jed The complexity of generalized domino tilings. (English) Zbl 1295.52026 Electron. J. Comb. 20, No. 4, Research Paper P12, 23 p. (2013). MSC: 52C22 05B45 68Q17 PDFBibTeX XMLCite \textit{I. Pak} and \textit{J. Yang}, Electron. J. Comb. 20, No. 4, Research Paper P12, 23 p. (2013; Zbl 1295.52026) Full Text: arXiv Link
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
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
Dessmark, A.; Lingas, A.; Proskurowski, A. Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time. (English) Zbl 0938.68143 Theor. Comput. Sci. 236, No. 1-2, 179-191 (2000). MSC: 68W05 PDFBibTeX XMLCite \textit{A. Dessmark} et al., Theor. Comput. Sci. 236, No. 1--2, 179--191 (2000; Zbl 0938.68143) Full Text: DOI
Kovacs, Tomas; Lingas, Andrzej Maximum packing for biconnected outerplanar graphs. (English) Zbl 0944.05075 Discrete Appl. Math. 100, No. 1-2, 85-94 (2000). Reviewer: K.R.Parthasarathy (Narayanapuram) MSC: 05C70 05C85 68R10 PDFBibTeX XMLCite \textit{T. Kovacs} and \textit{A. Lingas}, Discrete Appl. Math. 100, No. 1--2, 85--94 (2000; Zbl 0944.05075) 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
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
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
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
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