Henning, Michael A.; Shozi, Zekhaya B. A generalization of Petersen’s matching theorem. (English) Zbl 1506.05065 Discrete Math. 346, No. 3, Article ID 113263, 7 p. (2023). Reviewer: V. Lokesha (Bangalore) MSC: 05C15 05C07 05C35 05C40 PDFBibTeX XMLCite \textit{M. A. Henning} and \textit{Z. B. Shozi}, Discrete Math. 346, No. 3, Article ID 113263, 7 p. (2023; Zbl 1506.05065) Full Text: DOI
Fomin, Fedor V.; Sagunov, Danil; Simonov, Kirill Building large \(k\)-cores from sparse graphs. (English) Zbl 07639678 J. Comput. Syst. Sci. 132, 68-88 (2023). MSC: 68Q27 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., J. Comput. Syst. Sci. 132, 68--88 (2023; Zbl 07639678) Full Text: DOI
Henning, Michael A.; Yeo, Anders A complete description of convex sets associated with matchings and edge-connectivity in graphs. (English) Zbl 1522.05250 J. Graph Theory 101, No. 4, 643-667 (2022). MSC: 05C40 05C70 05C35 05C07 PDFBibTeX XMLCite \textit{M. A. Henning} and \textit{A. Yeo}, J. Graph Theory 101, No. 4, 643--667 (2022; Zbl 1522.05250) Full Text: DOI
Gu, Xiaofeng; Liu, Muhuo A tight lower bound on the matching number of graphs via Laplacian eigenvalues. (English) Zbl 1480.05106 Eur. J. Comb. 101, Article ID 103468, 8 p. (2022). MSC: 05C70 05C50 PDFBibTeX XMLCite \textit{X. Gu} and \textit{M. Liu}, Eur. J. Comb. 101, Article ID 103468, 8 p. (2022; Zbl 1480.05106) Full Text: DOI arXiv
Henning, Michael A.; Shozi, Zekhaya B. A characterization of graphs with given maximum degree and smallest possible matching number. II. (English) Zbl 1480.05028 Discrete Math. 345, No. 3, Article ID 112731, 11 p. (2022). MSC: 05C07 05C35 05C70 PDFBibTeX XMLCite \textit{M. A. Henning} and \textit{Z. B. Shozi}, Discrete Math. 345, No. 3, Article ID 112731, 11 p. (2022; Zbl 1480.05028) Full Text: DOI
Fürst, M.; Rautenbach, D. Uniquely restricted matchings in subcubic graphs without short cycles. (English) Zbl 1521.05158 J. Graph Theory 96, No. 4, 578-593 (2021). MSC: 05C70 05C38 PDFBibTeX XMLCite \textit{M. Fürst} and \textit{D. Rautenbach}, J. Graph Theory 96, No. 4, 578--593 (2021; Zbl 1521.05158) Full Text: DOI
Henning, Michael A.; Shozi, Zekhaya B. A characterization of the subcubic graphs achieving equality in the Haxell-Scott lower bound for the matching number. (English) Zbl 1521.05141 J. Graph Theory 96, No. 4, 455-471 (2021). MSC: 05C69 05C70 PDFBibTeX XMLCite \textit{M. A. Henning} and \textit{Z. B. Shozi}, J. Graph Theory 96, No. 4, 455--471 (2021; Zbl 1521.05141) Full Text: DOI
Henning, Michael A.; Yeo, Anders Matching and edge-connectivity in graphs with given maximum degree. (English) Zbl 1466.05110 Discrete Math. 344, No. 8, Article ID 112438, 18 p. (2021). MSC: 05C40 05C07 05C35 05C70 PDFBibTeX XMLCite \textit{M. A. Henning} and \textit{A. Yeo}, Discrete Math. 344, No. 8, Article ID 112438, 18 p. (2021; Zbl 1466.05110) Full Text: DOI
Henning, Michael A.; Shozi, Zekhaya B. A characterization of graphs with given maximum degree and smallest possible matching number. (English) Zbl 1466.05036 Discrete Math. 344, No. 7, Article ID 112426, 9 p. (2021). MSC: 05C07 05C35 05C70 PDFBibTeX XMLCite \textit{M. A. Henning} and \textit{Z. B. Shozi}, Discrete Math. 344, No. 7, Article ID 112426, 9 p. (2021; Zbl 1466.05036) Full Text: DOI
Fomin, Fedor V.; Sagunov, Danil; Simonov, Kirill Building large \(k\)-cores from sparse graphs. (English) Zbl 07559406 Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 35, 14 p. (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 170, Article 35, 14 p. (2020; Zbl 07559406) Full Text: DOI arXiv
Fürst, Maximilian; Henning, Michael A.; Rautenbach, Dieter Uniquely restricted matchings in subcubic graphs. (English) Zbl 1411.05217 Discrete Appl. Math. 262, 189-194 (2019). MSC: 05C70 PDFBibTeX XMLCite \textit{M. Fürst} et al., Discrete Appl. Math. 262, 189--194 (2019; Zbl 1411.05217) Full Text: DOI arXiv
Fürst, M.; Rautenbach, D. Lower bounds on the uniquely restricted matching number. (English) Zbl 1407.05193 Graphs Comb. 35, No. 1, 353-361 (2019). MSC: 05C70 PDFBibTeX XMLCite \textit{M. Fürst} and \textit{D. Rautenbach}, Graphs Comb. 35, No. 1, 353--361 (2019; Zbl 1407.05193) Full Text: DOI arXiv
Henning, Michael A.; Yeo, Anders Transversals and independence in linear hypergraphs with maximum degree two. (English) Zbl 1366.05076 Electron. J. Comb. 24, No. 2, Research Paper P2.50, 25 p. (2017). MSC: 05C65 05D15 05C69 PDFBibTeX XMLCite \textit{M. A. Henning} and \textit{A. Yeo}, Electron. J. Comb. 24, No. 2, Research Paper P2.50, 25 p. (2017; Zbl 1366.05076) Full Text: Link