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
Schwartz, Stephan An overview of graph covering and partitioning. (English) Zbl 1490.05220 Discrete Math. 345, No. 8, Article ID 112884, 17 p. (2022). MSC: 05C70 90C27 PDFBibTeX XMLCite \textit{S. Schwartz}, Discrete Math. 345, No. 8, Article ID 112884, 17 p. (2022; Zbl 1490.05220) 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
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
Chiarelli, Nina; Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. (English) Zbl 1380.68219 Theor. Comput. Sci. 705, 75-83 (2018). MSC: 68Q25 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{N. Chiarelli} et al., Theor. Comput. Sci. 705, 75--83 (2018; Zbl 1380.68219) Full Text: DOI arXiv Link
Ivanyos, Gábor; Kulkarni, Raghav; Qiao, Youming; Santha, Miklos; Sundaram, Aarthi On the complexity of trial and error for constraint satisfaction problems. (English) Zbl 1382.68114 J. Comput. Syst. Sci. 92, 48-64 (2018). MSC: 68Q25 PDFBibTeX XMLCite \textit{G. Ivanyos} et al., J. Comput. Syst. Sci. 92, 48--64 (2018; Zbl 1382.68114) Full Text: DOI arXiv Link
Takazawa, Kenjiro Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs. (English) Zbl 1387.90229 Discrete Optim. 26, 26-40 (2017). MSC: 90C27 05C70 05C85 68R10 05C45 68Q25 90C60 90C35 PDFBibTeX XMLCite \textit{K. Takazawa}, Discrete Optim. 26, 26--40 (2017; Zbl 1387.90229) Full Text: DOI Link
van Bevern, René; Bredereck, Robert; Chen, Jiehua; Froese, Vincent; Niedermeier, Rolf; Woeginger, Gerhard J. Network-based vertex dissolution. (English) Zbl 1327.68139 SIAM J. Discrete Math. 29, No. 2, 888-914 (2015). MSC: 68Q25 05C21 05C90 68Q17 90B10 91F10 PDFBibTeX XMLCite \textit{R. van Bevern} et al., SIAM J. Discrete Math. 29, No. 2, 888--914 (2015; Zbl 1327.68139) Full Text: DOI arXiv
van Bevern, René; Bredereck, Robert; Chen, Jiehua; Froese, Vincent; Niedermeier, Rolf; Woeginger, Gerhard J. Network-based dissolution. (English) Zbl 1426.68226 Csuhaj-Varjú, Erzsébet (ed.) et al., Mathematical foundations of computer science 2014. 39th international symposium, MFCS 2014, Budapest, Hungary, August 25–29, 2014. Proceedings, Part II. Berlin: Springer. Lect. Notes Comput. Sci. 8635, 69-80 (2014). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{R. van Bevern} et al., Lect. Notes Comput. Sci. 8635, 69--80 (2014; Zbl 1426.68226) 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
Hartvigsen, David; Li, Yanjun Polyhedron of triangle-free simple 2-matchings in subcubic graphs. (English) Zbl 1273.05175 Math. Program. 138, No. 1-2 (A), 43-82 (2013). MSC: 05C70 05C22 90C05 90C10 90C27 90C57 PDFBibTeX XMLCite \textit{D. Hartvigsen} and \textit{Y. Li}, Math. Program. 138, No. 1--2 (A), 43--82 (2013; Zbl 1273.05175) Full Text: DOI
Manthey, Bodo Minimum-weight cycle covers and their approximability. (English) Zbl 1172.05344 Discrete Appl. Math. 157, No. 7, 1470-1480 (2009). MSC: 05C70 05C38 PDFBibTeX XMLCite \textit{B. Manthey}, Discrete Appl. Math. 157, No. 7, 1470--1480 (2009; Zbl 1172.05344) Full Text: DOI Link
Takazawa, Kenjiro A weighted \(K _{t,t }\)-free \(t\)-factor algorithm for bipartite graphs. (English) Zbl 1143.05335 Lodi, Andrea (ed.) et al., Integer programming and combinatorial optimization. 13th international conference, IPCO 2008 Bertinoro, Italy, May 26–28, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-68886-0/pbk). Lecture Notes in Computer Science 5035, 62-76 (2008). MSC: 05C85 05C70 PDFBibTeX XMLCite \textit{K. Takazawa}, Lect. Notes Comput. Sci. 5035, 62--76 (2008; Zbl 1143.05335) Full Text: DOI
Manthey, Bodo Minimum-weight cycle covers and their approximability. (English) Zbl 1141.68541 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 33rd international workshop, WG 2007, Dornburg, Germany, June 21–23, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-74838-0/pbk). Lecture Notes in Computer Science 4769, 178-189 (2007). MSC: 68R10 05C38 05C85 68W25 PDFBibTeX XMLCite \textit{B. Manthey}, Lect. Notes Comput. Sci. 4769, 178--189 (2007; Zbl 1141.68541) 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
Hartvigsen, David Finding maximum square-free 2-matchings in bipartite graphs. (English) Zbl 1096.05042 J. Comb. Theory, Ser. B 96, No. 5, 693-705 (2006). MSC: 05C70 05C45 PDFBibTeX XMLCite \textit{D. Hartvigsen}, J. Comb. Theory, Ser. B 96, No. 5, 693--705 (2006; Zbl 1096.05042) Full Text: DOI
Diwan, Ajit A. Disconnected 2-factors in planar cubic bridgeless graphs. (English) Zbl 1029.05123 J. Comb. Theory, Ser. B 84, No. 2, 249-259 (2002). MSC: 05C70 PDFBibTeX XMLCite \textit{A. A. Diwan}, J. Comb. Theory, Ser. B 84, No. 2, 249--259 (2002; Zbl 1029.05123) 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
Kratochvíl, Jan; Poljak, Svatopluk Compatible 2-factors. (English) Zbl 0778.05064 Discrete Appl. Math. 36, No. 3, 253-266 (1992). Reviewer: P.Hell (Burnaby) MSC: 05C70 68Q25 PDFBibTeX XMLCite \textit{J. Kratochvíl} and \textit{S. Poljak}, Discrete Appl. Math. 36, No. 3, 253--266 (1992; Zbl 0778.05064) Full Text: DOI