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
Puleo, Gregory J.; Milenkovic, Olgica Correlation clustering with constrained cluster sizes and extended weights bounds. (English) Zbl 1337.68296 SIAM J. Optim. 25, No. 3, 1857-1872 (2015). MSC: 68W25 90C05 90C35 PDFBibTeX XMLCite \textit{G. J. Puleo} and \textit{O. Milenkovic}, SIAM J. Optim. 25, No. 3, 1857--1872 (2015; Zbl 1337.68296) Full Text: DOI arXiv
Cymer, Radosław Dulmage-Mendelsohn canonical decomposition as a generic pruning technique. (English) Zbl 1309.90116 Constraints 17, No. 3, 234-272 (2012). MSC: 90C35 PDFBibTeX XMLCite \textit{R. Cymer}, Constraints 17, No. 3, 234--272 (2012; Zbl 1309.90116) 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
Hell, Pavol; Kirkpatrick, David Linear-time certifying algorithms for near-graphical sequences. (English) Zbl 1185.05135 Discrete Math. 309, No. 18, 5703-5713 (2009). MSC: 05C85 05C70 05C07 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. Kirkpatrick}, Discrete Math. 309, No. 18, 5703--5713 (2009; Zbl 1185.05135) Full Text: DOI
Tankus, David; Tarsi, Michael Greedily constructing maximal partial \(f\)-factors. (English) Zbl 1214.05133 Discrete Math. 309, No. 8, 2180-2189 (2009). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{D. Tankus} and \textit{M. Tarsi}, Discrete Math. 309, No. 8, 2180--2189 (2009; Zbl 1214.05133) 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
Damaschke, Peter Minus domination in small-degree graphs. (English) Zbl 0971.05086 Discrete Appl. Math. 108, No. 1-2, 53-64 (2001). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 PDFBibTeX XMLCite \textit{P. Damaschke}, Discrete Appl. Math. 108, No. 1--2, 53--64 (2001; Zbl 0971.05086) 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
Fremuth-Paeger, Christian; Jungnickel, Dieter Balanced network flows. I: A unifying framework for design and analysis of matching algorithms. (English) Zbl 0999.90005 Networks 33, No. 1, 1-28 (1999). Reviewer: Matthias Ehrgott (Auckland) MSC: 90B10 90C35 05C85 PDFBibTeX XMLCite \textit{C. Fremuth-Paeger} and \textit{D. Jungnickel}, Networks 33, No. 1, 1--28 (1999; Zbl 0999.90005) Full Text: DOI
Zhou, Xiao; Nishizeki, Takao Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings. (English) Zbl 0981.05086 J. Comb. Theory, Ser. B 75, No. 2, 270-287 (1999). MSC: 05C70 05C15 PDFBibTeX XMLCite \textit{X. Zhou} and \textit{T. Nishizeki}, J. Comb. Theory, Ser. B 75, No. 2, 270--287 (1999; Zbl 0981.05086) Full Text: DOI
Hell, Pavol; Kirkpatrick, David; Li, Brenda Rounding in symmetric matrices and undirected graphs. (English) Zbl 0920.05062 Discrete Appl. Math. 70, No. 1, 1-21 (1996). MSC: 05C85 05C50 05C70 68R10 05C38 05C05 PDFBibTeX XMLCite \textit{P. Hell} et al., Discrete Appl. Math. 70, No. 1, 1--21 (1996; Zbl 0920.05062) Full Text: DOI
Anstee, R. P. Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm. (English) Zbl 0797.05065 Discrete Appl. Math. 44, No. 1-3, 247-260 (1993). Reviewer: P.Hell (Burnaby) MSC: 05C70 68R10 05C85 05C35 90B10 PDFBibTeX XMLCite \textit{R. P. Anstee}, Discrete Appl. Math. 44, No. 1--3, 247--260 (1993; Zbl 0797.05065) Full Text: DOI
Anstee, R. P. Simplified existence theorems for \((g,f)\)-factors. (English) Zbl 0735.05060 Discrete Appl. Math. 27, No. 1-2, 29-38 (1990). MSC: 05C70 PDFBibTeX XMLCite \textit{R. P. Anstee}, Discrete Appl. Math. 27, No. 1--2, 29--38 (1990; Zbl 0735.05060) Full Text: DOI
Heinrich, Katherine; Hell, Pavol; Kirkpatrick, David G.; Liu, Guizhen A simple existence criterion for \((g<f)\)-factors. (English) Zbl 0723.05101 Discrete Math. 85, No. 3, 313-317 (1990). Reviewer: Ma Zhongfan (Beijing) MSC: 05C70 PDFBibTeX XMLCite \textit{K. Heinrich} et al., Discrete Math. 85, No. 3, 313--317 (1990; Zbl 0723.05101) Full Text: DOI