Bénéteau, Laurine; Chalopin, Jérémie; Chepoi, Victor; Vaxès, Yann Graphs with \(G^p\)-connected medians. (English) Zbl 07807880 Math. Program. 203, No. 1-2 (B), 369-420 (2024). MSC: 05C78 90B80 90C27 PDFBibTeX XMLCite \textit{L. Bénéteau} et al., Math. Program. 203, No. 1--2 (B), 369--420 (2024; Zbl 07807880) Full Text: DOI arXiv
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
Pêcher, Arnaud; Wagler, Annegret K. Computing clique and chromatic number of circular-perfect graphs in polynomial time. (English) Zbl 1280.90102 Math. Program. 141, No. 1-2 (A), 121-133 (2013). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{A. Pêcher} and \textit{A. K. Wagler}, Math. Program. 141, No. 1--2 (A), 121--133 (2013; Zbl 1280.90102) 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
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