Casablanca, Rocío M.; Mol, Lucas; Oellermann, Ortrud R. Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs. (English) Zbl 1454.05062 Discrete Appl. Math. 289, 233-247 (2021). MSC: 05C40 PDFBibTeX XMLCite \textit{R. M. Casablanca} et al., Discrete Appl. Math. 289, 233--247 (2021; Zbl 1454.05062) Full Text: DOI arXiv
Mol, Lucas; Murphy, Matthew J. H.; Oellermann, Ortrud R. The threshold dimension of a graph. (English) Zbl 1450.05020 Discrete Appl. Math. 287, 118-133 (2020). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C12 05C05 05C76 PDFBibTeX XMLCite \textit{L. Mol} et al., Discrete Appl. Math. 287, 118--133 (2020; Zbl 1450.05020) Full Text: DOI arXiv
Moravcik, Gaia; Oellermann, Ortrud R.; Yusim, Samuel Comparing the metric and strong dimensions of graphs. (English) Zbl 1355.05100 Discrete Appl. Math. 220, 68-79 (2017). MSC: 05C12 PDFBibTeX XMLCite \textit{G. Moravcik} et al., Discrete Appl. Math. 220, 68--79 (2017; Zbl 1355.05100) Full Text: DOI
Lafrance, Philip; Oellermann, Ortrud R.; Pressey, Timothy Reconstructing trees from digitally convex sets. (English) Zbl 1350.05017 Discrete Appl. Math. 216, Part 1, 254-260 (2017). MSC: 05C05 05C60 PDFBibTeX XMLCite \textit{P. Lafrance} et al., Discrete Appl. Math. 216, Part 1, 254--260 (2017; Zbl 1350.05017) Full Text: DOI
van Aardt, Susan A.; Frick, Marietjie; Oellermann, Ortrud R.; de Wet, Johan Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs. (English) Zbl 1333.05177 Discrete Appl. Math. 205, 171-179 (2016). MSC: 05C45 05C40 PDFBibTeX XMLCite \textit{S. A. van Aardt} et al., Discrete Appl. Math. 205, 171--179 (2016; Zbl 1333.05177) Full Text: DOI
Borchert, Adam; Nicol, Skylar; Oellermann, Ortrud R. Global cycle properties of locally isometric graphs. (English) Zbl 1333.05173 Discrete Appl. Math. 205, 16-26 (2016). MSC: 05C45 05C38 05C12 05C07 PDFBibTeX XMLCite \textit{A. Borchert} et al., Discrete Appl. Math. 205, 16--26 (2016; Zbl 1333.05173) Full Text: DOI arXiv
Ramírez-Cruz, Yunior; Oellermann, Ortrud R.; Rodríguez-Velázquez, Juan A. The simultaneous metric dimension of graph families. (English) Zbl 1327.05186 Discrete Appl. Math. 198, 241-250 (2016). MSC: 05C40 05C05 68Q17 PDFBibTeX XMLCite \textit{Y. Ramírez-Cruz} et al., Discrete Appl. Math. 198, 241--250 (2016; Zbl 1327.05186) Full Text: DOI arXiv
Oellermann, Ortrud R.; Peters-Fransen, Joel The strong metric dimension of graphs and digraphs. (English) Zbl 1111.05030 Discrete Appl. Math. 155, No. 3, 356-364 (2007). MSC: 05C12 05C20 05C85 05C90 PDFBibTeX XMLCite \textit{O. R. Oellermann} and \textit{J. Peters-Fransen}, Discrete Appl. Math. 155, No. 3, 356--364 (2007; Zbl 1111.05030) Full Text: DOI
Dankelmann, Peter; Oellermann, Ortrud R.; Wu, Jian-Liang Minimum average distance of strong orientations of graphs. (English) Zbl 1055.05042 Discrete Appl. Math. 143, No. 1-3, 204-212 (2004). Reviewer: Ján Plesník (Bratislava) MSC: 05C12 05C20 PDFBibTeX XMLCite \textit{P. Dankelmann} et al., Discrete Appl. Math. 143, No. 1--3, 204--212 (2004; Zbl 1055.05042) Full Text: DOI
Henning, Michael A.; Oellermann, Ortrud R. The average connectivity of a digraph. (English) Zbl 1047.05024 Discrete Appl. Math. 140, No. 1-3, 143-153 (2004). Reviewer: Ján Plesník (Bratislava) MSC: 05C40 05C20 05C05 68R10 PDFBibTeX XMLCite \textit{M. A. Henning} and \textit{O. R. Oellermann}, Discrete Appl. Math. 140, No. 1--3, 143--153 (2004; Zbl 1047.05024) Full Text: DOI
Dankelmann, Peter; Oellermann, Ortrud R. Bounds on the average connectivity of a graph. (English) Zbl 1021.05062 Discrete Appl. Math. 129, No. 2-3, 305-318 (2003). Reviewer: Jun-Ming Xu (Hefei) MSC: 05C40 05C35 PDFBibTeX XMLCite \textit{P. Dankelmann} and \textit{O. R. Oellermann}, Discrete Appl. Math. 129, No. 2--3, 305--318 (2003; Zbl 1021.05062) Full Text: DOI
Dankelmann, Peter; Goddard, Wayne; Oellermann, Ortrud R.; Swart, Henda C. Augmenting trees so that every three vertices lie on a cycle. (English) Zbl 0990.05030 Discrete Appl. Math. 116, No. 1-2, 145-159 (2002). Reviewer: Ján Plesník (Bratislava) MSC: 05C05 05C38 05C40 05C85 68R10 PDFBibTeX XMLCite \textit{P. Dankelmann} et al., Discrete Appl. Math. 116, No. 1--2, 145--159 (2002; Zbl 0990.05030) Full Text: DOI
Chartrand, Gary; Eroh, Linda; Johnson, Mark A.; Oellermann, Ortrud R. Resolvability in graphs and the metric dimension of a graph. (English) Zbl 0958.05042 Discrete Appl. Math. 105, No. 1-3, 99-113 (2000). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C12 05C05 PDFBibTeX XMLCite \textit{G. Chartrand} et al., Discrete Appl. Math. 105, No. 1--3, 99--113 (2000; Zbl 0958.05042) Full Text: DOI
Kubicka, Ewa; Kubicki, Grzegorz; Oellermann, Ortrud R. Steiner intervals in graphs. (English) Zbl 0898.05044 Discrete Appl. Math. 81, No. 1-3, 181-190 (1998). Reviewer: B.Zelinka (Liberec) MSC: 05C38 05C05 PDFBibTeX XMLCite \textit{E. Kubicka} et al., Discrete Appl. Math. 81, No. 1--3, 181--190 (1998; Zbl 0898.05044) Full Text: DOI Link
Dankelmann, Peter; Swart, Henda C.; Oellermann, Ortrud R. On the average Steiner distance of graphs with presribed properties. (English) Zbl 0884.05040 Discrete Appl. Math. 79, No. 1-3, 91-103 (1997). Reviewer: Ján Plesník (Bratislava) MSC: 05C12 PDFBibTeX XMLCite \textit{P. Dankelmann} et al., Discrete Appl. Math. 79, No. 1--3, 91--103 (1997; Zbl 0884.05040) Full Text: DOI Link
Beineke, Lowell W.; Oellermann, Ortrud R.; Pippert, Raymond E. On the Steiner median of a tree. (English) Zbl 0858.05033 Discrete Appl. Math. 68, No. 3, 249-258 (1996). Reviewer: D.Cieslik (Greifswald) MSC: 05C05 05C12 PDFBibTeX XMLCite \textit{L. W. Beineke} et al., Discrete Appl. Math. 68, No. 3, 249--258 (1996; Zbl 0858.05033) Full Text: DOI
Fricke, Gerd H.; Henning, Michael A.; Oellermann, Ortrud R.; Swart, Henda C. An algorithm to find two distance domination parameters in a graph. (English) Zbl 0848.05040 Discrete Appl. Math. 68, No. 1-2, 85-91 (1996). Reviewer: B.Zelinka (Liberec) MSC: 05C35 05C12 05C85 PDFBibTeX XMLCite \textit{G. H. Fricke} et al., Discrete Appl. Math. 68, No. 1--2, 85--91 (1996; Zbl 0848.05040) Full Text: DOI