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
Bar-Noy, Amotz; Choudhary, Keerti; Peleg, David; Rawitz, Dror Graph realizations: maximum degree in vertex neighborhoods. (English) Zbl 1516.05032 Discrete Math. 346, No. 9, Article ID 113483, 16 p. (2023). MSC: 05C07 05C35 PDFBibTeX XMLCite \textit{A. Bar-Noy} et al., Discrete Math. 346, No. 9, Article ID 113483, 16 p. (2023; Zbl 1516.05032) Full Text: DOI
Havet, Frédéric; Mazauric, Dorian; Nguyen, Viet-Ha; Watrigant, Rémi Overlaying a hypergraph with a graph with bounded maximum degree. (English) Zbl 1494.05079 Discrete Appl. Math. 319, 394-406 (2022). MSC: 05C65 68Q25 92B99 PDFBibTeX XMLCite \textit{F. Havet} et al., Discrete Appl. Math. 319, 394--406 (2022; Zbl 1494.05079) Full Text: DOI
Bahmanian, Amin Ryser’s theorem for \(\rho\)-Latin rectangles. (English) Zbl 1491.05040 J. Comb. Theory, Ser. A 190, Article ID 105632, 21 p. (2022). MSC: 05B15 05C70 PDFBibTeX XMLCite \textit{A. Bahmanian}, J. Comb. Theory, Ser. A 190, Article ID 105632, 21 p. (2022; Zbl 1491.05040) Full Text: DOI arXiv
Bar-Noy, Amotz; Böhnlein, Toni; Peleg, David; Perry, Mor; Rawitz, Dror Relaxed and approximate graph realizations. (English) Zbl 07495010 Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 3-19 (2021). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{A. Bar-Noy} et al., Lect. Notes Comput. Sci. 12757, 3--19 (2021; Zbl 07495010) Full Text: DOI
Bar-Noy, Amotz; Choudhary, Keerti; Peleg, David; Rawitz, Dror Efficiently realizing interval sequences. (English) Zbl 1453.05123 SIAM J. Discrete Math. 34, No. 4, 2318-2337 (2020). MSC: 05C85 68R10 PDFBibTeX XMLCite \textit{A. Bar-Noy} et al., SIAM J. Discrete Math. 34, No. 4, 2318--2337 (2020; Zbl 1453.05123) Full Text: DOI arXiv
Gómez, Renzo; Wakabayashi, Yoshiko Nontrivial path covers of graphs: existence, minimization and maximization. (English) Zbl 1434.90209 J. Comb. Optim. 39, No. 2, 437-456 (2020). MSC: 90C35 05C70 90C27 PDFBibTeX XMLCite \textit{R. Gómez} and \textit{Y. Wakabayashi}, J. Comb. Optim. 39, No. 2, 437--456 (2020; Zbl 1434.90209) Full Text: DOI
Kano, Mikio; Lu, Hongliang; Yu, Qinglin Fractional factors, component factors and isolated vertex conditions in graphs. (English) Zbl 1428.05251 Electron. J. Comb. 26, No. 4, Research Paper P4.33, 11 p. (2019). MSC: 05C70 PDFBibTeX XMLCite \textit{M. Kano} et al., Electron. J. Comb. 26, No. 4, Research Paper P4.33, 11 p. (2019; Zbl 1428.05251) Full Text: arXiv Link
Beckenbach, Isabel; Scheidweiler, Robert Perfect \(f\)-matchings and \(f\)-factors in hypergraphs – a combinatorial approach. (English) Zbl 1367.05149 Discrete Math. 340, No. 10, 2499-2506 (2017). MSC: 05C65 05C70 68Q17 PDFBibTeX XMLCite \textit{I. Beckenbach} and \textit{R. Scheidweiler}, Discrete Math. 340, No. 10, 2499--2506 (2017; Zbl 1367.05149) Full Text: DOI
Djelloul, Selma Solving matching problems efficiently in bipartite graphs. (English) Zbl 1401.05231 Kratochvíl, Jan (ed.) et al., Combinatorial algorithms. 25th international workshop, IWOCA 2014, Duluth, MN, USA, October 15–17, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-19314-4/pbk; 978-3-319-19315-1/ebook). Lecture Notes in Computer Science 8986, 128-139 (2015). MSC: 05C70 05C85 68R10 68Q25 PDFBibTeX XMLCite \textit{S. Djelloul}, Lect. Notes Comput. Sci. 8986, 128--139 (2015; Zbl 1401.05231) Full Text: DOI
Bernshtein, A. Yu. 3-regular subgraphs and (3,1)-colorings of 4-regular pseudographs. (Russian, English) Zbl 1324.05054 Diskretn. Anal. Issled. Oper. 21, No. 5, 3-16 (2014); translation in J. Appl. Ind. Math. 8, No. 4, 458-466 (2014). MSC: 05C15 PDFBibTeX XMLCite \textit{A. Yu. Bernshtein}, Diskretn. Anal. Issled. Oper. 21, No. 5, 3--16 (2014; Zbl 1324.05054); translation in J. Appl. Ind. Math. 8, No. 4, 458--466 (2014) Full Text: DOI
Wang, Changping Subgraphs with orthogonal factorizations and algorithms. (English) Zbl 1208.05119 Eur. J. Comb. 31, No. 7, 1706-1713 (2010). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{C. Wang}, Eur. J. Comb. 31, No. 7, 1706--1713 (2010; Zbl 1208.05119) Full Text: DOI
Lu, HongLiang; Yu, QingLin Constructive proof of deficiency theorem of \((g,f)\)-factor. (English) Zbl 1209.05186 Sci. China, Math. 53, No. 6, 1657-1662 (2010). MSC: 05C70 05C75 PDFBibTeX XMLCite \textit{H. Lu} and \textit{Q. Yu}, Sci. China, Math. 53, No. 6, 1657--1662 (2010; Zbl 1209.05186) Full Text: DOI
Liu, Guizhen Some results on fractional graph theory. (English) Zbl 1162.05346 Ito, Hiro (ed.) et al., Computational geometry and graph theory. International conference, KyotoCGGT 2007, Kyoto, Japan, June 11–15, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-89549-7/pbk). Lecture Notes in Computer Science 4535, 108-118 (2008). MSC: 05C70 05C15 05C45 05C65 90C35 PDFBibTeX XMLCite \textit{G. Liu}, Lect. Notes Comput. Sci. 4535, 108--118 (2008; Zbl 1162.05346) Full Text: DOI
Addario-Berry, L.; Dalal, K.; Reed, B. A. Degree constrained subgraphs. (English) Zbl 1147.05055 Discrete Appl. Math. 156, No. 7, 1168-1174 (2008). MSC: 05C75 05C15 PDFBibTeX XMLCite \textit{L. Addario-Berry} et al., Discrete Appl. Math. 156, No. 7, 1168--1174 (2008; Zbl 1147.05055) 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
Li, Jianxiang; Ma, Yinghong Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs. (English) Zbl 1126.05041 J. Syst. Sci. Complex. 19, No. 4, 491-497 (2006). MSC: 05C07 PDFBibTeX XMLCite \textit{J. Li} and \textit{Y. Ma}, J. Syst. Sci. Complex. 19, No. 4, 491--497 (2006; Zbl 1126.05041) Full Text: DOI
Zhao, Hao; Liu, Guizhen; Yan, Xiaoxia \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs. (English) Zbl 1081.05096 Acta Math. Sin., Engl. Ser. 21, No. 2, 413-422 (2005). Reviewer: Martin Knor (Bratislava) MSC: 05C70 PDFBibTeX XMLCite \textit{H. Zhao} et al., Acta Math. Sin., Engl. Ser. 21, No. 2, 413--422 (2005; Zbl 1081.05096) Full Text: DOI
Liu, Guizhen; Zhu, Binhai Some problems on factorizations with constraints in bipartite graphs. (English) Zbl 1018.05088 Discrete Appl. Math. 128, No. 2-3, 421-434 (2003). MSC: 05C70 PDFBibTeX XMLCite \textit{G. Liu} and \textit{B. Zhu}, Discrete Appl. Math. 128, No. 2--3, 421--434 (2003; Zbl 1018.05088) Full Text: DOI
Liu, Gui-zhen; Long, He-ping Randomly orthogonal \((g,f)\)-factorizations in graphs. (English) Zbl 1010.05053 Acta Math. Appl. Sin., Engl. Ser. 18, No. 3, 489-494 (2002). MSC: 05C70 PDFBibTeX XMLCite \textit{G.-z. Liu} and \textit{H.-p. Long}, Acta Math. Appl. Sin., Engl. Ser. 18, No. 3, 489--494 (2002; Zbl 1010.05053) Full Text: DOI
Lam, Peter Che Bor; Liu, Guizhen; Li, Guojun; Shiu, Wai Chee Orthogonal \((g,f)\)-factorizations in networks. (English) Zbl 0974.05065 Networks 35, No. 4, 274-278 (2000). MSC: 05C70 90B18 05C85 PDFBibTeX XMLCite \textit{P. C. B. Lam} et al., Networks 35, No. 4, 274--278 (2000; Zbl 0974.05065) Full Text: DOI
Liu, G. Z.; Wang, J. F. \((a,b,k)\)-critical graphs. (English) Zbl 0901.05074 Chin. Sci. Bull. 42, No. 17, 1492-1493 (1997). Reviewer: P.Hell (Burnaby) MSC: 05C70 PDFBibTeX XMLCite \textit{G. Z. Liu} and \textit{J. F. Wang}, Chin. Sci. Bull. 42, No. 17, 1492--1493 (1997; Zbl 0901.05074) Full Text: DOI
Chen, Ciping Toughness of graphs and \([2,b]\)-factors. (English) Zbl 0805.05061 Graphs Comb. 10, No. 2, 97-100 (1994). Reviewer: M.Knor (Bratislava) MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{C. Chen}, Graphs Comb. 10, No. 2, 97--100 (1994; Zbl 0805.05061) Full Text: DOI
Wang, Tao Factors of trees. (English) Zbl 0802.05031 Discrete Math. 131, No. 1-3, 301-310 (1994). Reviewer: J.W.Moon (Edmonton) MSC: 05C05 05C70 05C85 PDFBibTeX XMLCite \textit{T. Wang}, Discrete Math. 131, No. 1--3, 301--310 (1994; Zbl 0802.05031) Full Text: DOI