Moscarini, Marina Computing a metric basis of a bipartite distance-hereditary graph. (English) Zbl 1518.05051 Theor. Comput. Sci. 900, 20-24 (2022). MSC: 05C12 68Q25 PDFBibTeX XMLCite \textit{M. Moscarini}, Theor. Comput. Sci. 900, 20--24 (2022; Zbl 1518.05051) Full Text: DOI
Moscarini, Marina Computing a metric basis of a 2-connected bipartite distance-hereditary graph. (English) Zbl 1436.68255 Theor. Comput. Sci. 804, 186-206 (2020). MSC: 68R10 05C12 05C85 68W40 PDFBibTeX XMLCite \textit{M. Moscarini}, Theor. Comput. Sci. 804, 186--206 (2020; Zbl 1436.68255) Full Text: DOI
Mezzini, Mauro; Moscarini, Marina The contour of a bridged graph is geodetic. (English) Zbl 1333.05098 Discrete Appl. Math. 204, 213-215 (2016). MSC: 05C12 05C38 05C40 PDFBibTeX XMLCite \textit{M. Mezzini} and \textit{M. Moscarini}, Discrete Appl. Math. 204, 213--215 (2016; Zbl 1333.05098) Full Text: DOI
Mezzini, Mauro; Moscarini, Marina On the geodeticity of the contour of a graph. (English) Zbl 1304.05027 Discrete Appl. Math. 181, 209-220 (2015). MSC: 05C10 05C12 05C38 PDFBibTeX XMLCite \textit{M. Mezzini} and \textit{M. Moscarini}, Discrete Appl. Math. 181, 209--220 (2015; Zbl 1304.05027) Full Text: DOI
Malvestuto, Francesco M.; Mezzini, Mauro; Moscarini, Marina Computing simple-path convex hulls in hypergraphs. (English) Zbl 1259.05170 Inf. Process. Lett. 111, No. 5, 231-234 (2011). MSC: 05C85 05C65 PDFBibTeX XMLCite \textit{F. M. Malvestuto} et al., Inf. Process. Lett. 111, No. 5, 231--234 (2011; Zbl 1259.05170) Full Text: DOI