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
Kobayashi, Kenya; Lin, Guohui; Miyano, Eiji; Saitoh, Toshiki; Suzuki, Akira; Utashima, Tadatoshi; Yagita, Tsuyoshi Path cover problems with length cost. (English) Zbl 07767693 Algorithmica 85, No. 11, 3348-3375 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{K. Kobayashi} et al., Algorithmica 85, No. 11, 3348--3375 (2023; Zbl 07767693) Full Text: DOI
Chen, Yuan; Dai, Guowei; Hu, Zhiquan \(P_k\)-factors in squares and line graphs of trees. (English) Zbl 07736287 Appl. Math. Comput. 458, Article ID 128244, 6 p. (2023). MSC: 05C38 05C70 PDFBibTeX XMLCite \textit{Y. Chen} et al., Appl. Math. Comput. 458, Article ID 128244, 6 p. (2023; Zbl 07736287) Full Text: DOI
Snauwaert, Jakob; Van Eynde, Rob; Vanhoucke, Mario On the complexity of efficient multi-skilled team composition. (English) Zbl 07705484 Comput. Oper. Res. 157, Article ID 106277, 17 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{J. Snauwaert} et al., Comput. Oper. Res. 157, Article ID 106277, 17 p. (2023; Zbl 07705484) Full Text: DOI
Jha, Pranava K. Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube. (English) Zbl 1516.05153 Discrete Appl. Math. 337, 218-231 (2023). MSC: 05C65 05C60 PDFBibTeX XMLCite \textit{P. K. Jha}, Discrete Appl. Math. 337, 218--231 (2023; Zbl 1516.05153) Full Text: DOI
Chang, Fan; Han, Jie; Kim, Jaehoon; Wang, Guanghui; Yang, Donglei Embedding clique-factors in graphs with low \(\ell\)-independence number. (English) Zbl 1512.05331 J. Comb. Theory, Ser. B 161, 301-330 (2023). MSC: 05C70 05D10 PDFBibTeX XMLCite \textit{F. Chang} et al., J. Comb. Theory, Ser. B 161, 301--330 (2023; Zbl 1512.05331) Full Text: DOI arXiv
Lindeberg, Anna; Hellmuth, Marc Construction of \(k\)-matchings in graph products. (English) Zbl 1502.05214 Art Discrete Appl. Math. 6, No. 2, Paper No. P2.02, 36 p. (2023). MSC: 05C76 05C70 68Q17 90C27 PDFBibTeX XMLCite \textit{A. Lindeberg} and \textit{M. Hellmuth}, Art Discrete Appl. Math. 6, No. 2, Paper No. P2.02, 36 p. (2023; Zbl 1502.05214) Full Text: DOI arXiv
Gong, Shicai; Zhang, Liping; Su, Changbao On the number of all substructures containing at most four edges. (English) Zbl 1505.92281 MATCH Commun. Math. Comput. Chem. 89, No. 2, 327-342 (2023). MSC: 92E10 05C92 05C09 PDFBibTeX XMLCite \textit{S. Gong} et al., MATCH Commun. Math. Comput. Chem. 89, No. 2, 327--342 (2023; Zbl 1505.92281) Full Text: DOI
Chang, Yulin; Han, Jie; Kohayakawa, Yoshiharu; Morris, Patrick; Mota, Guilherme Oliveira Factors in randomly perturbed hypergraphs. (English) Zbl 1522.05420 Random Struct. Algorithms 60, No. 2, 153-165 (2022). MSC: 05C80 05C65 PDFBibTeX XMLCite \textit{Y. Chang} et al., Random Struct. Algorithms 60, No. 2, 153--165 (2022; Zbl 1522.05420) Full Text: DOI arXiv
Arvind, V.; Fuhlbrück, Frank; Köbler, Johannes; Verbitsky, Oleg On the Weisfeiler-Leman dimension of fractional packing. (English) Zbl 07601280 Inf. Comput. 288, Article ID 104803, 17 p. (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{V. Arvind} et al., Inf. Comput. 288, Article ID 104803, 17 p. (2022; Zbl 07601280) 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
Grüttemeier, Niels; Komusiewicz, Christian Learning Bayesian networks under sparsity constraints: a parameterized complexity analysis. (English) Zbl 07566011 J. Artif. Intell. Res. (JAIR) 74, 1225-1267 (2022). MSC: 68Txx PDFBibTeX XMLCite \textit{N. Grüttemeier} and \textit{C. Komusiewicz}, J. Artif. Intell. Res. (JAIR) 74, 1225--1267 (2022; Zbl 07566011) Full Text: DOI arXiv
Kobayashi, Kenya; Lin, Guohui; Miyano, Eiji; Saitoh, Toshiki; Suzuki, Akira; Utashima, Tadatoshi; Yagita, Tsuyoshi Path cover problems with length cost. (English) Zbl 07556587 Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 396-408 (2022). MSC: 68Wxx PDFBibTeX XMLCite \textit{K. Kobayashi} et al., Lect. Notes Comput. Sci. 13174, 396--408 (2022; Zbl 07556587) Full Text: DOI
Li, Wenjun; Ye, Junjie; Cao, Yixin A \(5k\)-vertex kernel for \(P_2\)-packing. (English) Zbl 07496373 Theor. Comput. Sci. 910, 1-13 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{W. Li} et al., Theor. Comput. Sci. 910, 1--13 (2022; Zbl 07496373) Full Text: DOI
Belmonte, Rémy; Hanaka, Tesshu; Kanzaki, Masaaki; Kiyomi, Masashi; Kobayashi, Yasuaki; Kobayashi, Yusuke; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of \((A,\ell)\)-path packing. (English) Zbl 07495627 Algorithmica 84, No. 4, 871-895 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{R. Belmonte} et al., Algorithmica 84, No. 4, 871--895 (2022; Zbl 07495627) 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
Han, Jie; Kohayakawa, Yoshiharu; Morris, Patrick; Person, Yury Finding any given 2-factor in sparse pseudorandom graphs efficiently. (English) Zbl 1521.05183 J. Graph Theory 96, No. 1, 87-108 (2021). MSC: 05C80 05C42 PDFBibTeX XMLCite \textit{J. Han} et al., J. Graph Theory 96, No. 1, 87--108 (2021; Zbl 1521.05183) Full Text: DOI
McKay, Michael; Manlove, David The three-dimensional stable roommates problem with additively separable preferences. (English) Zbl 07535997 Caragiannis, Ioannis (ed.) et al., Algorithmic game theory. 14th international symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12885, 266-280 (2021). MSC: 91B68 91A68 91A12 PDFBibTeX XMLCite \textit{M. McKay} and \textit{D. Manlove}, Lect. Notes Comput. Sci. 12885, 266--280 (2021; Zbl 07535997) Full Text: DOI arXiv Link
Balogh, József; Csaba, Béla; Pluhár, András; Treglown, Andrew A discrepancy version of the Hajnal-Szemerédi theorem. (English) Zbl 1466.05174 Comb. Probab. Comput. 30, No. 3, 444-459 (2021). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{J. Balogh} et al., Comb. Probab. Comput. 30, No. 3, 444--459 (2021; Zbl 1466.05174) 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
Jansen, Bart M. P. Crossing paths with Hans Bodlaender: a personal view on cross-composition for sparsification lower bounds. (English) Zbl 07604207 Fomin, Fedor V. (ed.) et al., Treewidth, kernels, and algorithms. Essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 12160, 89-111 (2020). MSC: 68-XX PDFBibTeX XMLCite \textit{B. M. P. Jansen}, Lect. Notes Comput. Sci. 12160, 89--111 (2020; Zbl 07604207) Full Text: DOI
Dai, Guowei; Hu, Zhiquan \(P_3\)-factors in the square of a tree. (English) Zbl 1459.05136 Graphs Comb. 36, No. 6, 1913-1925 (2020). MSC: 05C38 05C70 05C05 PDFBibTeX XMLCite \textit{G. Dai} and \textit{Z. Hu}, Graphs Comb. 36, No. 6, 1913--1925 (2020; Zbl 1459.05136) Full Text: DOI
Hyde, Joseph; Treglown, Andrew A degree sequence version of the Kühn-Osthus tiling theorem. (English) Zbl 1442.05107 Electron. J. Comb. 27, No. 3, Research Paper P3.48, 30 p. (2020). MSC: 05C35 05C70 PDFBibTeX XMLCite \textit{J. Hyde} and \textit{A. Treglown}, Electron. J. Comb. 27, No. 3, Research Paper P3.48, 30 p. (2020; Zbl 1442.05107) Full Text: DOI arXiv
Bachstein, Anna; Goddard, Wayne; Lehmacher, Connor The generalized matcher game. (English) Zbl 1443.05125 Discrete Appl. Math. 284, 444-453 (2020). MSC: 05C57 91A43 91A05 PDFBibTeX XMLCite \textit{A. Bachstein} et al., Discrete Appl. Math. 284, 444--453 (2020; Zbl 1443.05125) Full Text: DOI arXiv
Han, Jie; Treglown, Andrew The complexity of perfect matchings and packings in dense hypergraphs. (English) Zbl 1430.05093 J. Comb. Theory, Ser. B 141, 72-104 (2020). MSC: 05C70 05C65 05C42 PDFBibTeX XMLCite \textit{J. Han} and \textit{A. Treglown}, J. Comb. Theory, Ser. B 141, 72--104 (2020; Zbl 1430.05093) Full Text: DOI arXiv
Czygrinow, Andrzej; Debiasio, Louis; Molla, Theodore; Treglown, Andrew Tiling directed graphs with tournaments. (English) Zbl 1406.05080 Forum Math. Sigma 6, Paper No. e2, 53 p. (2018). MSC: 05C70 05C20 05C35 PDFBibTeX XMLCite \textit{A. Czygrinow} et al., Forum Math. Sigma 6, Paper No. e2, 53 p. (2018; Zbl 1406.05080) Full Text: DOI arXiv
Feng, Qilong; Huang, Neng; Jiang, Xiong; Wang, Jianxin Dealing with several parameterized problems by random methods. (English) Zbl 1393.68131 Theor. Comput. Sci. 734, 94-104 (2018). MSC: 68R10 05C70 05C85 68Q25 68W20 PDFBibTeX XMLCite \textit{Q. Feng} et al., Theor. Comput. Sci. 734, 94--104 (2018; Zbl 1393.68131) Full Text: DOI
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
Goodall, A.; Hermann, M.; Kotek, T.; Makowsky, J. A.; Noble, S. D. On the complexity of generalized chromatic polynomials. (English) Zbl 1378.05059 Adv. Appl. Math. 94, 71-102 (2018). MSC: 05C15 05C31 05C85 68Q17 68W05 PDFBibTeX XMLCite \textit{A. Goodall} et al., Adv. Appl. Math. 94, 71--102 (2018; Zbl 1378.05059) Full Text: DOI arXiv Link
Gao, Wei; Han, Jie Minimum codegree threshold for \(C_6^3\)-factors in 3-uniform hypergraphs. (English) Zbl 1371.05202 Comb. Probab. Comput. 26, No. 4, 536-559 (2017). MSC: 05C65 05C70 PDFBibTeX XMLCite \textit{W. Gao} and \textit{J. Han}, Comb. Probab. Comput. 26, No. 4, 536--559 (2017; Zbl 1371.05202) Full Text: DOI arXiv
Guruswami, Venkatesan; Lee, Euiwoong Inapproximability of \(H\)-transversal/packing. (English) Zbl 1371.68099 SIAM J. Discrete Math. 31, No. 3, 1552-1571 (2017). MSC: 68Q17 05C70 68W25 PDFBibTeX XMLCite \textit{V. Guruswami} and \textit{E. Lee}, SIAM J. Discrete Math. 31, No. 3, 1552--1571 (2017; Zbl 1371.68099) Full Text: DOI
Martin, Ryan R.; Mycroft, Richard; Skokan, Jozef An asymptotic multipartite Kühn-Osthus theorem. (English) Zbl 1366.05057 SIAM J. Discrete Math. 31, No. 3, 1498-1513 (2017). MSC: 05C35 05C70 PDFBibTeX XMLCite \textit{R. R. Martin} et al., SIAM J. Discrete Math. 31, No. 3, 1498--1513 (2017; Zbl 1366.05057) Full Text: DOI arXiv
van Bevern, René; Bredereck, Robert; Bulteau, Laurent; Chen, Jiehua; Froese, Vincent; Niedermeier, Rolf; Woeginger, Gerhard J. Partitioning perfect graphs into stars. (English) Zbl 1365.05238 J. Graph Theory 85, No. 2, 297-335 (2017). MSC: 05C70 05C17 05C85 PDFBibTeX XMLCite \textit{R. van Bevern} et al., J. Graph Theory 85, No. 2, 297--335 (2017; Zbl 1365.05238) Full Text: DOI arXiv
Han, Jie The complexity of perfect packings in dense graphs. (English) Zbl 1485.68185 Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 14th annual conference, TAMC 2017, Bern, Switzerland, April 20–22, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10185, 289-303 (2017). MSC: 68R10 05C70 68Q17 68Q25 PDFBibTeX XMLCite \textit{J. Han}, Lect. Notes Comput. Sci. 10185, 289--303 (2017; Zbl 1485.68185) Full Text: DOI
Ahadi, Arash; Dehghan, Ali; Mollahajiaghaei, Mohsen Algorithmic complexity of weakly semiregular partitioning and the representation number. (English) Zbl 1369.68224 Theor. Comput. Sci. 674, 60-72 (2017). MSC: 68Q25 05C07 05C70 05C85 PDFBibTeX XMLCite \textit{A. Ahadi} et al., Theor. Comput. Sci. 674, 60--72 (2017; Zbl 1369.68224) Full Text: DOI arXiv
Baptiste, Philippe; Kovalyov, Mikhail Y.; Orlovich, Yury L.; Werner, Frank; Zverovich, Igor E. Graphs with maximal induced matchings of the same size. (English) Zbl 1350.05129 Discrete Appl. Math. 216, Part 1, 15-28 (2017). MSC: 05C70 05C35 68Q17 05C60 PDFBibTeX XMLCite \textit{P. Baptiste} et al., Discrete Appl. Math. 216, Part 1, 15--28 (2017; Zbl 1350.05129) Full Text: DOI
Feng, Qilong; Jiang, Xiong; Wang, Jianxin Improved algorithms for several parameterized problems based on random methods. (English) Zbl 1475.68462 Zhu, Daming (ed.) et al., Frontiers in algorithmics. 10th international workshop, FAW 2016, Qingdao, China, June 30 – July 2, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9711, 65-74 (2016). MSC: 68W20 68Q27 68R10 68W40 PDFBibTeX XMLCite \textit{Q. Feng} et al., Lect. Notes Comput. Sci. 9711, 65--74 (2016; Zbl 1475.68462) Full Text: DOI
Chang, Maw-Shang; Chen, Li-Hsuan; Hung, Ling-Ju An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs. (English) Zbl 1354.90104 J. Comb. Optim. 32, No. 2, 594-607 (2016). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{M.-S. Chang} et al., J. Comb. Optim. 32, No. 2, 594--607 (2016; Zbl 1354.90104) Full Text: DOI
Treglown, Andrew A degree sequence Hajnal-Szemerédi theorem. (English) Zbl 1332.05117 J. Comb. Theory, Ser. B 118, 13-43 (2016). MSC: 05C70 PDFBibTeX XMLCite \textit{A. Treglown}, J. Comb. Theory, Ser. B 118, 13--43 (2016; Zbl 1332.05117) Full Text: DOI arXiv
Treglown, Andrew On directed versions of the Hajnal-Szemerédi theorem. (English) Zbl 1371.05234 Comb. Probab. Comput. 24, No. 6, 873-928 (2015). MSC: 05C70 05C20 PDFBibTeX XMLCite \textit{A. Treglown}, Comb. Probab. Comput. 24, No. 6, 873--928 (2015; Zbl 1371.05234) Full Text: DOI arXiv
Neggazi, Brahim; Haddad, Mohammed; Kheddouci, Hamamache A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs. (English) Zbl 1331.68155 Inf. Process. Lett. 115, No. 11, 892-898 (2015). MSC: 68R10 05C51 05C85 68W15 PDFBibTeX XMLCite \textit{B. Neggazi} et al., Inf. Process. Lett. 115, No. 11, 892--898 (2015; Zbl 1331.68155) 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
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan Parameterized complexity of induced graph matching on claw-free graphs. (English) Zbl 1306.05163 Algorithmica 70, No. 3, 513-560 (2014). MSC: 05C60 05C70 05C69 68Q25 68P05 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Algorithmica 70, No. 3, 513--560 (2014; Zbl 1306.05163) Full Text: DOI
Lonc, Zbigniew; Petryshyn, Nataliya On rooted packings, decompositions, and factors of graphs. (English) Zbl 1291.05161 J. Graph Theory 76, No. 2, 106-128 (2014). MSC: 05C70 PDFBibTeX XMLCite \textit{Z. Lonc} and \textit{N. Petryshyn}, J. Graph Theory 76, No. 2, 106--128 (2014; Zbl 1291.05161) Full Text: DOI
Chalopin, Jérémie; Paulusma, Daniël Packing bipartite graphs with covers of complete bipartite graphs. (English) Zbl 1285.05146 Discrete Appl. Math. 168, 40-50 (2014). MSC: 05C70 05C60 PDFBibTeX XMLCite \textit{J. Chalopin} and \textit{D. Paulusma}, Discrete Appl. Math. 168, 40--50 (2014; Zbl 1285.05146) Full Text: DOI
Porschen, Stefan; Schmidt, Tatjana; Speckenmeyer, Ewald; Wotzlaw, Andreas XSAT and NAE-SAT of linear CNF classes. (English) Zbl 1284.05106 Discrete Appl. Math. 167, 1-14 (2014). MSC: 05C15 05C65 68Q17 PDFBibTeX XMLCite \textit{S. Porschen} et al., Discrete Appl. Math. 167, 1--14 (2014; Zbl 1284.05106) Full Text: DOI
Feng, Qilong; Wang, Jianxin; Chen, Jianer Matching and weighted \(P_2\)-packing: algorithms and kernels. (English) Zbl 1279.68101 Theor. Comput. Sci. 522, 85-94 (2014). MSC: 68Q17 05C85 05C70 68W20 PDFBibTeX XMLCite \textit{Q. Feng} et al., Theor. Comput. Sci. 522, 85--94 (2014; Zbl 1279.68101) Full Text: DOI
Krysztowiak, Przemysław An improved approximation ratio for the jump number problem on interval orders. (English) Zbl 1335.68295 Theor. Comput. Sci. 513, 77-84 (2013). MSC: 68W25 05C70 05C85 06A07 68Q17 90C27 PDFBibTeX XMLCite \textit{P. Krysztowiak}, Theor. Comput. Sci. 513, 77--84 (2013; Zbl 1335.68295) Full Text: DOI
Golovach, Petr A.; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. Induced packing of odd cycles in planar graphs. (English) Zbl 1232.68064 Theor. Comput. Sci. 420, 28-35 (2012). MSC: 68Q17 05C70 05C85 68R10 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 420, 28--35 (2012; Zbl 1232.68064) Full Text: DOI
Orlovich, Yury; Dolgui, Alexandre; Finke, Gerd; Gordon, Valery; Werner, Frank The complexity of dissociation set problems in graphs. (English) Zbl 1223.68058 Discrete Appl. Math. 159, No. 13, 1352-1366 (2011). MSC: 68Q25 05C85 05C69 PDFBibTeX XMLCite \textit{Y. Orlovich} et al., Discrete Appl. Math. 159, No. 13, 1352--1366 (2011; Zbl 1223.68058) Full Text: DOI
Király, Zoltán; Szabó, Jácint Induced graph packing problems. (English) Zbl 1230.05236 Graphs Comb. 26, No. 2, 243-257 (2010). MSC: 05C70 PDFBibTeX XMLCite \textit{Z. Király} and \textit{J. Szabó}, Graphs Comb. 26, No. 2, 243--257 (2010; Zbl 1230.05236) Full Text: DOI
Wang, Jianxin; Ning, Dan; Feng, Qilong; Chen, Jianer An improved kernelization for \(P_{2}\)-packing. (English) Zbl 1206.68354 Inf. Process. Lett. 110, No. 5, 188-192 (2010). MSC: 68W05 68R10 68R05 PDFBibTeX XMLCite \textit{J. Wang} et al., Inf. Process. Lett. 110, No. 5, 188--192 (2010; Zbl 1206.68354) Full Text: DOI
Johnson, Matthew; Paulusma, Daniël; Wood, Chantal Path factors and parallel knock-out schemes of almost claw-free graphs. (English) Zbl 1219.05140 Discrete Math. 310, No. 9, 1413-1423 (2010). MSC: 05C70 05C38 05C35 PDFBibTeX XMLCite \textit{M. Johnson} et al., Discrete Math. 310, No. 9, 1413--1423 (2010; Zbl 1219.05140) Full Text: DOI Link
Kühn, Daniela; Osthus, Deryk The minimum degree threshold for perfect graph packings. (English) Zbl 1517.05143 Combinatorica 29, No. 1, 65-107 (2009). MSC: 05C70 05C35 05C15 PDFBibTeX XMLCite \textit{D. Kühn} and \textit{D. Osthus}, Combinatorica 29, No. 1, 65--107 (2009; Zbl 1517.05143) Full Text: DOI arXiv
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
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
Bryś, Krzysztof; Lonc, Zbigniew Polynomial cases of graph decomposition: A complete solution of Holyer’s problem. (English) Zbl 1214.05112 Discrete Math. 309, No. 6, 1294-1326 (2009). MSC: 05C70 68R10 PDFBibTeX XMLCite \textit{K. Bryś} and \textit{Z. Lonc}, Discrete Math. 309, No. 6, 1294--1326 (2009; Zbl 1214.05112) Full Text: DOI
Reinhardt, Klaus The simple reachability problem in switch graphs. (English) Zbl 1206.68240 Nielsen, Mogens (ed.) et al., SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 24–30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). Lecture Notes in Computer Science 5404, 461-472 (2009). MSC: 68R10 05C70 68Q25 PDFBibTeX XMLCite \textit{K. Reinhardt}, Lect. Notes Comput. Sci. 5404, 461--472 (2009; Zbl 1206.68240) Full Text: DOI
Kosowski, Adrian; Małafiejski, Michał; Żyliński, Paweł Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph. (English) Zbl 1204.05077 Graphs Comb. 24, No. 5, 461-468 (2008). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{A. Kosowski} et al., Graphs Comb. 24, No. 5, 461--468 (2008; Zbl 1204.05077) Full Text: DOI
Bardeli, Rolf; Clausen, Michael; Ribbrock, Andreas A covering problem that is easy for trees but \(\mathbf{NP}\)-complete for trivalent graphs. (English) Zbl 1169.05371 Discrete Appl. Math. 156, No. 15, 2855-2866 (2008). MSC: 05C70 05C85 05C05 05C38 PDFBibTeX XMLCite \textit{R. Bardeli} et al., Discrete Appl. Math. 156, No. 15, 2855--2866 (2008; Zbl 1169.05371) Full Text: DOI
Li, Xiaojuan; Zhang, Zhao Path-factors in the square of a tree. (English) Zbl 1155.05053 Graphs Comb. 24, No. 2, 107-111 (2008). MSC: 05C70 05C38 05C05 PDFBibTeX XMLCite \textit{X. Li} and \textit{Z. Zhang}, Graphs Comb. 24, No. 2, 107--111 (2008; Zbl 1155.05053) Full Text: DOI
Orlovich, Yury; Finke, Gerd; Gordon, Valery; Zverovich, Igor Approximability results for the maximum and minimum maximal induced matching problems. (English) Zbl 1140.90479 Discrete Optim. 5, No. 3, 584-593 (2008). MSC: 90C27 90C35 68W25 68Q17 05C69 05C70 PDFBibTeX XMLCite \textit{Y. Orlovich} et al., Discrete Optim. 5, No. 3, 584--593 (2008; Zbl 1140.90479) Full Text: DOI Link
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
Kosowski, Adrian; Małafiejski, Michał; Ẓyliński, Paweł An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs. (English) Zbl 1184.05124 Inf. Process. Lett. 99, No. 6, 230-233 (2006). MSC: 05C85 05C38 68W25 68R10 PDFBibTeX XMLCite \textit{A. Kosowski} et al., Inf. Process. Lett. 99, No. 6, 230--233 (2006; Zbl 1184.05124) 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
Béjar, Ramón; Domshlak, Carmel; Fernández, Cèsar; Gomes, Carla; Krishnamachari, Bhaskar; Selman, Bart; Valls, Magda Sensor networks and distributed CSP: communication, computation and complexity. (English) Zbl 1132.68688 Artif. Intell. 161, No. 1-2, 117-147 (2005). MSC: 68T20 68M14 68Q25 68W15 PDFBibTeX XMLCite \textit{R. Béjar} et al., Artif. Intell. 161, No. 1--2, 117--147 (2005; Zbl 1132.68688) Full Text: DOI Link
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
Kaneko, Atsushi; Kelmans, Alexander; Nishimura, Tsuyoshi On packing 3-vertex paths in a graph. (English) Zbl 1060.05081 J. Graph Theory 36, No. 4, 175-197 (2001). Reviewer: Gerard J. Chang (MR 2002a:05196) MSC: 05C70 05C38 PDFBibTeX XMLCite \textit{A. Kaneko} et al., J. Graph Theory 36, No. 4, 175--197 (2001; Zbl 1060.05081) 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 Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial. (English) Zbl 0868.05041 J. Comb. Theory, Ser. B 69, No. 2, 164-182 (1997). Reviewer: Z.Lonc (Warszawa) MSC: 05C70 68Q25 PDFBibTeX XMLCite \textit{Z. Lonc}, J. Comb. Theory, Ser. B 69, No. 2, 164--182 (1997; Zbl 0868.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 Towards a solution of the Holyer’s problem. (English) Zbl 07784157 van Leeuwen, Jan (ed.), WG ’93. Graph-theoretic concepts in computer science, 19th international workshop, Utrecht, the Netherlands, June 16–18, 1993. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 790, 144-152 (1994). MSC: 05C85 05C70 68Q25 68R10 PDFBibTeX XMLCite \textit{Z. Lonc}, Lect. Notes Comput. Sci. 790, 144--152 (1994; Zbl 07784157) Full Text: DOI
Hell, P.; Manoussakis, Y.; Tuza, Zs. Packing problems in edge-colored graphs. (English) Zbl 0806.05054 Discrete Appl. Math. 52, No. 3, 295-306 (1994). Reviewer: M.Truszczyński (Lexington) MSC: 05C70 05C15 PDFBibTeX XMLCite \textit{P. Hell} et al., Discrete Appl. Math. 52, No. 3, 295--306 (1994; Zbl 0806.05054) Full Text: DOI
Corneil, Derek G.; Masuyama, Shigeru; Hakimi, S. Louis Edge-disjoint packings of graphs. (English) Zbl 0793.68114 Discrete Appl. Math. 50, No. 2, 135-148 (1994). MSC: 68R10 68Q25 05C70 PDFBibTeX XMLCite \textit{D. G. Corneil} et al., Discrete Appl. Math. 50, No. 2, 135--148 (1994; Zbl 0793.68114) 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
Akiyama, Jin; Chvátal, Vašek Packing paths perfectly. (English) Zbl 0723.05092 Discrete Math. 85, No. 3, 247-255 (1990). Reviewer: Ma Zhongfan (Beijing) MSC: 05C70 05C38 PDFBibTeX XMLCite \textit{J. Akiyama} and \textit{V. Chvátal}, Discrete Math. 85, No. 3, 247--255 (1990; Zbl 0723.05092) Full Text: DOI
Shiraishi, Shuji A parallel algorithm for the maximum 2-chain edge packing problem. (English) Zbl 0677.68078 Inf. Process. Lett. 32, No. 6, 277-279 (1989). MSC: 68R10 68N25 05C38 PDFBibTeX XMLCite \textit{S. Shiraishi}, Inf. Process. Lett. 32, No. 6, 277--279 (1989; Zbl 0677.68078) Full Text: DOI Link
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
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
Cornuéjols, Gérard; Hartvigsen, David An extension of matching theory. (English) Zbl 0563.05048 J. Comb. Theory, Ser. B 40, 285-296 (1986). MSC: 05C70 PDFBibTeX XMLCite \textit{G. Cornuéjols} and \textit{D. Hartvigsen}, J. Comb. Theory, Ser. B 40, 285--296 (1986; Zbl 0563.05048) Full Text: DOI
Corneil, D. G. The complexity of generalized clique packing. (English) Zbl 0588.05037 Discrete Appl. Math. 12, 233-239 (1985). Reviewer: L.Niepel MSC: 05C70 05C35 68Q25 68R10 PDFBibTeX XMLCite \textit{D. G. Corneil}, Discrete Appl. Math. 12, 233--239 (1985; Zbl 0588.05037) 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
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