Mol, Lucas; Murphy, Matthew J. H.; Oellermann, Ortrud R. The threshold dimension and irreducible graphs. (English) Zbl 1504.05081 Discuss. Math., Graph Theory 43, No. 1, 195-210 (2023). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C12 05C69 PDFBibTeX XMLCite \textit{L. Mol} et al., Discuss. Math., Graph Theory 43, No. 1, 195--210 (2023; Zbl 1504.05081) Full Text: DOI arXiv
Ali, Akbar [Oellermann, Ortrud] An interview with Ortrud Oellermann. (English) Zbl 1499.01021 DML, Discrete Math. Lett. 10, 115-123 (2022). MSC: 01A70 PDFBibTeX XMLCite \textit{A. Ali}, DML, Discrete Math. Lett. 10, 115--123 (2022; Zbl 1499.01021) Full Text: DOI
Casablanca, Rocío M.; Dankelmann, Peter; Goddard, Wayne; Mol, Lucas; Oellermann, Ortrud The maximum average connectivity among all orientations of a graph. (English) Zbl 1491.05115 J. Comb. Optim. 43, No. 3, 543-570 (2022). Reviewer: Yilun Shang (Newcastle) MSC: 05C40 05C10 05C35 PDFBibTeX XMLCite \textit{R. M. Casablanca} et al., J. Comb. Optim. 43, No. 3, 543--570 (2022; Zbl 1491.05115) Full Text: DOI arXiv Link
Mol, Lucas; Oellermann, Ortrud R.; Oswal, Vibhav On the average (edge-)connectivity of minimally \(k\)-(edge-)connected graphs. (English) Zbl 1483.05086 Bull. Inst. Comb. Appl. 94, 95-110 (2022). Reviewer: Shinya Fujita (Maebashi) MSC: 05C40 05C75 05C35 PDFBibTeX XMLCite \textit{L. Mol} et al., Bull. Inst. Comb. Appl. 94, 95--110 (2022; Zbl 1483.05086) Full Text: arXiv Link
Benakli, Nadia; Bong, Novi H.; Dueck (Gosselin), Shonda; Novick, Beth; Oellermann, Ortrud R. The threshold dimension and threshold strong dimension of a graph: a survey. (English) Zbl 1482.05081 Ferrero, Daniela (ed.) et al., Research trends in graph theory and applications. Based on the workshop for women in graph theory and applications, University of Minnesota, Minneapolis, MN, USA, August 19–23, 2019. Cham: Springer. Assoc. Women Math. Ser. 25, 73-98 (2021). MSC: 05C12 05C40 PDFBibTeX XMLCite \textit{N. Benakli} et al., Assoc. Women Math. Ser. 25, 73--98 (2021; Zbl 1482.05081) Full Text: DOI
Benakli, Nadia; Bong, Novi H.; Dueck, Shonda; Eroh, Linda; Novick, Beth; Oellermann, Ortrud R. The threshold strong dimension of a graph. (English) Zbl 1466.05106 Discrete Math. 344, No. 7, Article ID 112402, 16 p. (2021). MSC: 05C38 05C12 05C35 PDFBibTeX XMLCite \textit{N. Benakli} et al., Discrete Math. 344, No. 7, Article ID 112402, 16 p. (2021; Zbl 1466.05106) Full Text: DOI arXiv
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
Balodis, Kristaps J.; Mol, Lucas; Oellermann, Ortrud R.; Kroeker, Matthew E. On the mean order of connected induced subgraphs of block graphs. (English) Zbl 1439.05123 Australas. J. Comb. 76, Part 1, 128-148 (2020). MSC: 05C40 05C51 PDFBibTeX XMLCite \textit{K. J. Balodis} et al., Australas. J. Comb. 76, Part 1, 128--148 (2020; Zbl 1439.05123) Full Text: arXiv Link
Carr, MacKenzie; Mynhardt, Christina M.; Oellermann, Ortrud R. Enumerating the Digitally Convex Sets of Powers of Cycles and Cartesian Products of Paths and Complete Graphs. arXiv:2008.02781 Preprint, arXiv:2008.02781 [math.CO] (2020). MSC: 05C69 05C30 05C76 05C38 05A15 05A19 BibTeX Cite \textit{M. Carr} et al., ``Enumerating the Digitally Convex Sets of Powers of Cycles and Cartesian Products of Paths and Complete Graphs'', Preprint, arXiv:2008.02781 [math.CO] (2020) Full Text: arXiv OA License
Mol, Lucas; Oellermann, Ortrud R. Maximizing the mean subtree order. (English) Zbl 1417.05031 J. Graph Theory 91, No. 4, 326-352 (2019). MSC: 05C05 PDFBibTeX XMLCite \textit{L. Mol} and \textit{O. R. Oellermann}, J. Graph Theory 91, No. 4, 326--352 (2019; Zbl 1417.05031) Full Text: DOI arXiv
Oellermann, Ortrud R. Some of my favourite conjectures: local conditions implying global cycle properties. (English) Zbl 1414.05177 Gera, Ralucca (ed.) et al., Graph theory. Favorite conjectures and open problems – 2. Cham: Springer. Probl. Books Math., 91-100 (2018). MSC: 05C45 05C40 PDFBibTeX XMLCite \textit{O. R. Oellermann}, in: Graph theory. Favorite conjectures and open problems -- 2. Cham: Springer. 91--100 (2018; Zbl 1414.05177) Full Text: DOI
Kroeker, Matthew E.; Mol, Lucas; Oellermann, Ortrud R. On the mean connected induced subgraph order of cographs. (English) Zbl 1404.05103 Australas. J. Comb. 71, 1, 161-183 (2018). MSC: 05C40 PDFBibTeX XMLCite \textit{M. E. Kroeker} et al., Australas. J. Comb. 71, 161--183 (2018; Zbl 1404.05103) Full Text: arXiv Link
Brown, Jason I.; Mol, Lucas; Oellermann, Ortrud R. On the roots of Wiener polynomials of graphs. (English) Zbl 1392.05057 Discrete Math. 341, No. 9, 2398-2408 (2018). MSC: 05C31 05C12 05C40 PDFBibTeX XMLCite \textit{J. I. Brown} et al., Discrete Math. 341, No. 9, 2398--2408 (2018; Zbl 1392.05057) Full Text: DOI arXiv
Stephens, Alexander M.; Oellermann, Ortrud R. The mean order of sub-\(k\)-trees of \(k\)-trees. (English) Zbl 1391.05082 J. Graph Theory 88, No. 1, 61-79 (2018). MSC: 05C05 05C30 05A15 05A16 PDFBibTeX XMLCite \textit{A. M. Stephens} and \textit{O. R. Oellermann}, J. Graph Theory 88, No. 1, 61--79 (2018; Zbl 1391.05082) Full Text: DOI
van Aardt, Susan A.; Dunbar, Jean E.; Frick, Marietjie; Oellermann, Ortrud R.; de Wet, Johan P. On Saito’s conjecture and the Oberly-Sumner conjectures. (English) Zbl 1371.05152 Graphs Comb. 33, No. 4, 583-594 (2017). MSC: 05C38 05C45 05C40 PDFBibTeX XMLCite \textit{S. A. van Aardt} et al., Graphs Comb. 33, No. 4, 583--594 (2017; Zbl 1371.05152) Full Text: DOI
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
Borchert, Adam; Nicol, Skylar; Oellermann, Ortrud R. Global cycle properties in graphs with large minimum clustering coefficient. (English) Zbl 1422.05056 Quaest. Math. 39, No. 8, 1047-1070 (2016). MSC: 05C38 PDFBibTeX XMLCite \textit{A. Borchert} et al., Quaest. Math. 39, No. 8, 1047--1070 (2016; Zbl 1422.05056) Full Text: DOI arXiv
Lafrance, Philip; Oellermann, Ortrud R.; Pressey, Timothy Generating and enumerating digitally convex sets of trees. (English) Zbl 1338.05042 Graphs Comb. 32, No. 2, 721-732 (2016). MSC: 05C05 05C69 PDFBibTeX XMLCite \textit{P. Lafrance} et al., Graphs Comb. 32, No. 2, 721--732 (2016; Zbl 1338.05042) 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
Brown, Jason I.; Oellermann, Ortrud R. On the spectrum and number of convex sets in graphs. (English) Zbl 1309.05116 Discrete Math. 338, No. 7, 1144-1153 (2015). MSC: 05C50 05C30 05C80 PDFBibTeX XMLCite \textit{J. I. Brown} and \textit{O. R. Oellermann}, Discrete Math. 338, No. 7, 1144--1153 (2015; Zbl 1309.05116) Full Text: DOI
Kubicka, E.; Kubicki, G.; Oellermann, O. R. Global properties of graphs with local degree conditions. arXiv:1506.04114 Preprint, arXiv:1506.04114 [math.CO] (2015). MSC: 05C38 05C40 05C12 BibTeX Cite \textit{E. Kubicka} et al., ``Global properties of graphs with local degree conditions'', Preprint, arXiv:1506.04114 [math.CO] (2015) Full Text: arXiv OA License
Ramírez-Cruz, Yunior; Oellermann, Ortrud R.; Rodríguez-Velázquez, Juan A. Simultaneous resolvability in graph families. (English) Zbl 1338.05223 Rodríguez Velázques, Juan Alberto (ed.) et al., Extended abstracts of the IX “Jornadas de matemática discreta y algorítmica” (JMDA), Tarragona, Spain, July 7–9, 2014. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 46, 241-248, electronic only (2014). MSC: 05C75 05C12 PDFBibTeX XMLCite \textit{Y. Ramírez-Cruz} et al., Electron. Notes Discrete Math. 46, 241--248 (2014; Zbl 1338.05223) Full Text: DOI
Brown, Jason; Oellermann, Ortrud R. Graphs with a minimal number of convex sets. (English) Zbl 1306.05041 Graphs Comb. 30, No. 6, 1383-1397 (2014). MSC: 05C12 05C75 05C35 PDFBibTeX XMLCite \textit{J. Brown} and \textit{O. R. Oellermann}, Graphs Comb. 30, No. 6, 1383--1397 (2014; Zbl 1306.05041) Full Text: DOI
Rodríguez-Velázquez, Juan A.; Yero, Ismael G.; Kuziak, Dorota; Oellermann, Ortrud R. On the strong metric dimension of Cartesian and direct products of graphs. (English) Zbl 1298.05280 Discrete Math. 335, 8-19 (2014). MSC: 05C76 05C75 PDFBibTeX XMLCite \textit{J. A. Rodríguez-Velázquez} et al., Discrete Math. 335, 8--19 (2014; Zbl 1298.05280) Full Text: DOI arXiv
van Aardt, Susan A.; Frick, Marietjie; Dunbar, Jean E.; Nielsen, Morten H.; Oellermann, Ortrud R. Characterizations of \(k\)-traceable graphs and oriented graphs. (English) Zbl 1274.05203 Util. Math. 90, 269-281 (2013). MSC: 05C20 05C75 PDFBibTeX XMLCite \textit{S. A. van Aardt} et al., Util. Math. 90, 269--281 (2013; Zbl 1274.05203)
Oellermann, Ortrud R. On domination and digital convexity parameters. (English) Zbl 1274.05360 J. Comb. Math. Comb. Comput. 85, 273-285 (2013). MSC: 05C69 PDFBibTeX XMLCite \textit{O. R. Oellermann}, J. Comb. Math. Comb. Comput. 85, 273--285 (2013; Zbl 1274.05360)
Beineke, Lowell W. (ed.); Wilson, Robin J. (ed.) [Oellermann, Ortrud R.] Topics in structural graph theory. (English) Zbl 1266.05002 Encyclopedia of Mathematics and its Applications 147. Cambridge: Cambridge University Press (ISBN 978-0-521-80231-4/hbk). xiv, 327 p. (2013). Reviewer: Herbert Fleischner (Wien) MSC: 05-02 05C40 05C90 05C75 PDFBibTeX XMLCite \textit{L. W. Beineke} (ed.) and \textit{R. J. Wilson} (ed.), Topics in structural graph theory. Cambridge: Cambridge University Press (2013; Zbl 1266.05002)
Cáceres, Jose; Oellermann, Ortrud R.; Puertas, M. L. Minimal trees and monophonic convexity. (English) Zbl 1293.05314 Discuss. Math., Graph Theory 32, No. 4, 685-704 (2012). MSC: 05C75 05C12 05C17 05C05 PDFBibTeX XMLCite \textit{J. Cáceres} et al., Discuss. Math., Graph Theory 32, No. 4, 685--704 (2012; Zbl 1293.05314) Full Text: DOI
Nielsen, Morten H.; Oellermann, Ortrud R. Separation properties of 3-Steiner and 3-monophonic convexity in graphs. (English) Zbl 1252.05045 Discrete Math. 312, No. 22, 3293-3305 (2012). MSC: 05C10 05C05 52A99 PDFBibTeX XMLCite \textit{M. H. Nielsen} and \textit{O. R. Oellermann}, Discrete Math. 312, No. 22, 3293--3305 (2012; Zbl 1252.05045) Full Text: DOI
Nielsen, Morten H.; Oellermann, Ortrud R. Local \(3\)-monophonic convexity. (English) Zbl 1242.05074 J. Comb. Math. Comb. Comput. 80, 11-24 (2012). MSC: 05C10 52A99 PDFBibTeX XMLCite \textit{M. H. Nielsen} and \textit{O. R. Oellermann}, J. Comb. Math. Comb. Comput. 80, 11--24 (2012; Zbl 1242.05074)
May, Teresa R.; Oellermann, Ortrud R. The strong dimension of distance-hereditary graphs. (English) Zbl 1233.05097 J. Comb. Math. Comb. Comput. 76, 59-73 (2011). MSC: 05C12 05C85 PDFBibTeX XMLCite \textit{T. R. May} and \textit{O. R. Oellermann}, J. Comb. Math. Comb. Comput. 76, 59--73 (2011; Zbl 1233.05097)
Bullock, Frank; Dankelmann, Peter; Frick, Marietjie; Henning, Michael A.; Oellermann, Ortrud R.; van Aardt, Susan Hamiltonicity of \(k\)-traceable graphs. (English) Zbl 1217.05129 Electron. J. Comb. 18, No. 1, Research Paper P63, 13 p. (2011). MSC: 05C45 05C38 PDFBibTeX XMLCite \textit{F. Bullock} et al., Electron. J. Comb. 18, No. 1, Research Paper P63, 13 p. (2011; Zbl 1217.05129) Full Text: EuDML EMIS
Nielsen, Morten H.; Oellermann, Ortrud R. Helly theorems for 3-Steiner and 3-monophonic convexity in graphs. (English) Zbl 1223.05158 Discrete Math. 311, No. 10-11, 872-880 (2011). MSC: 05C40 05C38 05C70 05C05 PDFBibTeX XMLCite \textit{M. H. Nielsen} and \textit{O. R. Oellermann}, Discrete Math. 311, No. 10--11, 872--880 (2011; Zbl 1223.05158) Full Text: DOI
Goddard, Wayne; Oellermann, Ortrud R. Distance in graphs. (English) Zbl 1221.05113 Dehmer, Matthias (ed.), Structural analysis of complex networks. Basel: Birkhäuser (ISBN 978-0-8176-4788-9/hbk; 978-0-8176-4789-6/ebook). 49-72 (2011). MSC: 05C12 05C20 05C38 PDFBibTeX XMLCite \textit{W. Goddard} and \textit{O. R. Oellermann}, in: Structural analysis of complex networks. Basel: Birkhäuser. 49--72 (2011; Zbl 1221.05113) Full Text: DOI
Cáceres, J.; Oellermann, O. R.; Puertas, M. L. m_3^3-Convex geometries are A-free. arXiv:1107.1048 Preprint, arXiv:1107.1048 [math.CO] (2011). MSC: 05C75 05C12 05C17 BibTeX Cite \textit{J. Cáceres} et al., ``m_3^3-Convex geometries are A-free'', Preprint, arXiv:1107.1048 [math.CO] (2011) Full Text: arXiv OA License
van Aardt, Susan A.; Dunbar, Jean E.; Frick, Marietjie; Katrenič, Peter; Nielsen, Morten H.; Oellermann, Ortrud R. Traceability of \(k\)-traceable oriented graphs. (English) Zbl 1195.05030 Discrete Math. 310, No. 8, 1325-1333 (2010). MSC: 05C20 PDFBibTeX XMLCite \textit{S. A. van Aardt} et al., Discrete Math. 310, No. 8, 1325--1333 (2010; Zbl 1195.05030) Full Text: DOI
Nielsen, Morten H.; Oellermann, Ortrud R. Steiner trees and convex geometries. (English) Zbl 1191.05037 SIAM J. Discrete Math. 23, No. 2, 680-693 (2009). MSC: 05C12 05C75 05C17 52A01 PDFBibTeX XMLCite \textit{M. H. Nielsen} and \textit{O. R. Oellermann}, SIAM J. Discrete Math. 23, No. 2, 680--693 (2009; Zbl 1191.05037) Full Text: DOI
van Aardt, Susan A.; Frick, Marietjie; Dunbar, Jean E.; Oellermann, Ortrud Detour saturated oriented graphs. (English) Zbl 1220.05053 Util. Math. 79, 167-180 (2009). MSC: 05C20 05C38 05C15 PDFBibTeX XMLCite \textit{S. A. van Aardt} et al., Util. Math. 79, 167--180 (2009; Zbl 1220.05053)
Cáceres, Jóse; Oellermann, Ortrud R. On 3-Steiner simplicial orderings. (English) Zbl 1221.05042 Discrete Math. 309, No. 19, 5828-5833 (2009). MSC: 05C05 PDFBibTeX XMLCite \textit{J. Cáceres} and \textit{O. R. Oellermann}, Discrete Math. 309, No. 19, 5828--5833 (2009; Zbl 1221.05042) Full Text: DOI
Oellermann, Ortrud R.; Phillips, Stephanie Steiner intervals in strongly chordal graphs. (English) Zbl 1176.05025 J. Comb. Math. Comb. Comput. 68, 19-31 (2009). MSC: 05C12 05C17 05C85 PDFBibTeX XMLCite \textit{O. R. Oellermann} and \textit{S. Phillips}, J. Comb. Math. Comb. Comput. 68, 19--31 (2009; Zbl 1176.05025)
Henning, Michael A.; Nielsen, Morten H.; Oellermann, Ortrud R. Local Steiner convexity. (English) Zbl 1205.05191 Eur. J. Comb. 30, No. 5, 1186-1193 (2009). MSC: 05C75 05C12 PDFBibTeX XMLCite \textit{M. A. Henning} et al., Eur. J. Comb. 30, No. 5, 1186--1193 (2009; Zbl 1205.05191) Full Text: DOI
Frick, Marietjie; van Aardt, Susan A.; Dunbar, Jean E.; Nielsen, Morten H.; Oellermann, Ortrud R. A traceability conjecture for oriented graphs. (English) Zbl 1178.05046 Electron. J. Comb. 15, No. 1, Research Paper R150, 13 p. (2008). MSC: 05C20 05C38 05C15 05C45 PDFBibTeX XMLCite \textit{M. Frick} et al., Electron. J. Comb. 15, No. 1, Research Paper R150, 13 p. (2008; Zbl 1178.05046) Full Text: EuDML EMIS
Eroh, Linda; Oellermann, Ortrud R. Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs. (English) Zbl 1156.05017 Discrete Math. 308, No. 18, 4212-4220 (2008). Reviewer: Frank Plastria (Brussels) MSC: 05C12 PDFBibTeX XMLCite \textit{L. Eroh} and \textit{O. R. Oellermann}, Discrete Math. 308, No. 18, 4212--4220 (2008; Zbl 1156.05017) Full Text: DOI
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
Oellermann, Ortrud R.; Puertas, María Luz Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs. (English) Zbl 1113.05030 Discrete Math. 307, No. 1, 88-96 (2007). Reviewer: Ján Plesník (Bratislava) MSC: 05C12 05C05 05C38 52B40 PDFBibTeX XMLCite \textit{O. R. Oellermann} and \textit{M. L. Puertas}, Discrete Math. 307, No. 1, 88--96 (2007; Zbl 1113.05030) Full Text: DOI
Oellermann, Ortrud R.; Pawluck, Charlene D.; Stokke, Anna The metric dimension of Cayley digraphs of abelian groups. (English) Zbl 1189.05055 Ars Comb. 81, 97-111 (2006). Reviewer: Jan Hora (Praha) MSC: 05C12 05C20 PDFBibTeX XMLCite \textit{O. R. Oellermann} et al., Ars Comb. 81, 97--111 (2006; Zbl 1189.05055)
Peters-Fransen, Joel; Oellermann, Ortrud R. The metric dimension of Cartesian products of graphs. (English) Zbl 1109.05041 Util. Math. 69, 33-41 (2006). Reviewer: Ulrike Baumann (Dresden) MSC: 05C12 PDFBibTeX XMLCite \textit{J. Peters-Fransen} and \textit{O. R. Oellermann}, Util. Math. 69, 33--41 (2006; Zbl 1109.05041)
Goddard, Wayne; Henning, Michael A.; Oellermann, Ortrud R. Hendrika Cornelia Swart. (English) Zbl 1127.01323 Util. Math. 69, 3-11 (2006). MSC: 01A70 05-03 PDFBibTeX XMLCite \textit{W. Goddard} et al., Util. Math. 69, 3--11 (2006; Zbl 1127.01323)
Fehr, Melodie; Gosselin, Shonda; Oellermann, Ortrud R. The partition dimension of Cayley digraphs. (English) Zbl 1086.05024 Aequationes Math. 71, No. 1-2, 1-18 (2006). MSC: 05C12 05C20 05C90 PDFBibTeX XMLCite \textit{M. Fehr} et al., Aequationes Math. 71, No. 1--2, 1--18 (2006; Zbl 1086.05024) Full Text: DOI
Fehr, Melodie; Gosselin, Shonda; Oellermann, Ortrud R. The metric dimension of Cayley digraphs. (English) Zbl 1085.05034 Discrete Math. 306, No. 1, 31-41 (2006). MSC: 05C25 05C20 05C12 90C05 90C10 PDFBibTeX XMLCite \textit{M. Fehr} et al., Discrete Math. 306, No. 1, 31--41 (2006; Zbl 1085.05034) Full Text: DOI
Dankelmann, Peter; Oellermann, Ortrud Degree sequences of optimally edge-connected multigraphs. (English) Zbl 1164.05334 Ars Comb. 77, 161-168 (2005). Reviewer: Tomáš Kaiser (Plzeň) MSC: 05C07 05C40 PDFBibTeX XMLCite \textit{P. Dankelmann} and \textit{O. Oellermann}, Ars Comb. 77, 161--168 (2005; Zbl 1164.05334)
Frick, Marietjie; van Aardt, Susan; Dlamini, Gcina; Dunbar, Jean; Oellermann, Ortrud The directed path partition conjecture. (English) Zbl 1118.05040 Discuss. Math., Graph Theory 25, No. 3, 331-343 (2005). Reviewer: Arnfried Kemnitz (Braunschweig) MSC: 05C20 05C38 05C15 PDFBibTeX XMLCite \textit{M. Frick} et al., Discuss. Math., Graph Theory 25, No. 3, 331--343 (2005; Zbl 1118.05040) Full Text: DOI
Cáceres, José; Márquez, Alberto; Oellermann, Ortrud R.; Puertas, María Luz Rebuilding convex sets in graphs. (English) Zbl 1070.05035 Discrete Math. 297, No. 1-3, 26-37 (2005). MSC: 05C12 05C75 PDFBibTeX XMLCite \textit{J. Cáceres} et al., Discrete Math. 297, No. 1--3, 26--37 (2005; Zbl 1070.05035) Full Text: DOI Link
Henning, Michael A.; Oellermann, Ortrud R. Metric-locating-dominating sets in graphs. (English) Zbl 1073.05051 Ars Comb. 73, 129-141 (2004). Reviewer: Lutz Volkmann (Aachen) MSC: 05C69 PDFBibTeX XMLCite \textit{M. A. Henning} and \textit{O. R. Oellermann}, Ars Comb. 73, 129--141 (2004; Zbl 1073.05051)
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
Eroh, Linda; Oellermann, Ortrud R. Bipartite rainbow Ramsey numbers. (English) Zbl 1036.05032 Discrete Math. 277, No. 1-3, 57-72 (2004). Reviewer: Gregory Loren McColm (Tampa) MSC: 05C55 PDFBibTeX XMLCite \textit{L. Eroh} and \textit{O. R. Oellermann}, Discrete Math. 277, No. 1--3, 57--72 (2004; Zbl 1036.05032) Full Text: DOI
Henning, Michael A.; Oellermann, Ortrud R. On upper domination Ramsey numbers for graphs. (English) Zbl 1037.05034 Discrete Math. 274, No. 1-3, 125-135 (2004). Reviewer: Jack E. Graver (Syracuse) MSC: 05C55 PDFBibTeX XMLCite \textit{M. A. Henning} and \textit{O. R. Oellermann}, Discrete Math. 274, No. 1--3, 125--135 (2004; Zbl 1037.05034) Full Text: DOI
Chartrand, Gary; Hevia, Héctor; Oellermann, Ortrud R. On \(m\)-chromatic factorizations of complete graphs. (English) Zbl 1038.05050 J. Comb. Math. Comb. Comput. 47, 3-17 (2003). Reviewer: L. Lesniak (Madison) MSC: 05C70 05C15 PDFBibTeX XMLCite \textit{G. Chartrand} et al., J. Comb. Math. Comb. Comput. 47, 3--17 (2003; Zbl 1038.05050)
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
Henning, Michael A.; Oellermann, Ortrud R.; Swart, Henda C. Distance domination critical graphs. (English) Zbl 1035.05064 J. Comb. Math. Comb. Comput. 44, 33-45 (2003). Reviewer: Bert Randerath (Köln) MSC: 05C69 05C12 PDFBibTeX XMLCite \textit{M. A. Henning} et al., J. Comb. Math. Comb. Comput. 44, 33--45 (2003; Zbl 1035.05064)
Beineke, Lowell W.; Oellermann, Ortrud R.; Pippert, Raymond E. The average connectivity of a graph. (English) Zbl 1002.05040 Discrete Math. 252, No. 1-3, 31-45 (2002). Reviewer: Mark E.Watkins (Syracuse) MSC: 05C40 PDFBibTeX XMLCite \textit{L. W. Beineke} et al., Discrete Math. 252, No. 1--3, 31--45 (2002; Zbl 1002.05040) Full Text: DOI
Henning, Michael A.; Oellermann, Ortrud R. The upper domination Ramsey number \(u(3,3,3)\). (English) Zbl 0994.05093 Discrete Math. 242, No. 1-3, 103-113 (2002). Reviewer: Ralph Faudree (Memphis) MSC: 05C55 05C69 PDFBibTeX XMLCite \textit{M. A. Henning} and \textit{O. R. Oellermann}, Discrete Math. 242, No. 1--3, 103--113 (2002; Zbl 0994.05093) 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
Currie, James; Oellermann, Ortrud R. The metric dimension and metric independence of a graph. (English) Zbl 0986.05040 J. Comb. Math. Comb. Comput. 39, 157-167 (2001). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C12 05C85 68R10 05C90 90C10 PDFBibTeX XMLCite \textit{J. Currie} and \textit{O. R. Oellermann}, J. Comb. Math. Comb. Comput. 39, 157--167 (2001; Zbl 0986.05040)
Henning, Michael A.; Oellermann, Ortrud R. The average connectivity of regular multipartite tournaments. (English) Zbl 0977.05072 Australas. J. Comb. 23, 101-113 (2001). Reviewer: Mark E.Watkins (Syracuse) MSC: 05C40 05C20 PDFBibTeX XMLCite \textit{M. A. Henning} and \textit{O. R. Oellermann}, Australas. J. Comb. 23, 101--113 (2001; Zbl 0977.05072)
Goddard, Wayne; Oellermann, Ortrud R.; Slater, Peter J.; Swart, Henda C. Bounds on the total redundance and efficiency of a graph. (English) Zbl 0993.05103 Ars Comb. 54, 129-138 (2000). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 05C38 PDFBibTeX XMLCite \textit{W. Goddard} et al., Ars Comb. 54, 129--138 (2000; Zbl 0993.05103)
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
Oellermann, Ortrud R. On the irregularity cost of a tree. (English) Zbl 0958.05120 J. Comb. Math. Comb. Comput. 33, 181-192 (2000). Reviewer: Fedor V.Fomin (St.Peterburg) MSC: 05C78 05C05 PDFBibTeX XMLCite \textit{O. R. Oellermann}, J. Comb. Math. Comb. Comput. 33, 181--192 (2000; Zbl 0958.05120)
Goddard, Wayne; Henning, Michael A.; Oellermann, Ortrud R. Bipartite Ramsey numbers and Zarankiewicz numbers. (English) Zbl 0953.05051 Discrete Math. 219, No. 1-3, 85-95 (2000). Reviewer: Jack E.Graver (Syracuse) MSC: 05C55 05C35 PDFBibTeX XMLCite \textit{W. Goddard} et al., Discrete Math. 219, No. 1--3, 85--95 (2000; Zbl 0953.05051) Full Text: DOI
Oellermann, Ortrud R. On Steiner centers and Steiner medians of graphs. (English) Zbl 0968.05027 Networks 34, No. 4, 258-263 (1999). MSC: 05C12 90C35 90B10 05C05 PDFBibTeX XMLCite \textit{O. R. Oellermann}, Networks 34, No. 4, 258--263 (1999; Zbl 0968.05027) Full Text: DOI
Day, D. P.; Oellermann, Ortrud R.; Swart, Henda C. Bounds on the size of graphs of given order and \(l\)-connectivity. (English) Zbl 0927.05051 Discrete Math. 197-198, 217-223 (1999). Reviewer: P.Horák (Safat) MSC: 05C40 05C35 PDFBibTeX XMLCite \textit{D. P. Day} et al., Discrete Math. 197--198, 217--223 (1999; Zbl 0927.05051) Full Text: DOI
Henning, Michael A.; Oellermann, Ortrud R. Bipartite Ramsey theorems for multiple copies of \(K_{2,2}\). (English) Zbl 0918.05075 Util. Math. 54, 13-23 (1998). Reviewer: R.J.Faudree (Memphis) MSC: 05C55 PDFBibTeX XMLCite \textit{M. A. Henning} and \textit{O. R. Oellermann}, Util. Math. 54, 13--23 (1998; Zbl 0918.05075)
Dankelmann, Peter; Swart, Henda C.; Oellermann, Ortrud R. On three conjectures of GRAFFITI. (English) Zbl 0897.05034 J. Comb. Math. Comb. Comput. 26, 131-137 (1998). Reviewer: I.Tomescu (Bucureşti) MSC: 05C12 05C70 PDFBibTeX XMLCite \textit{P. Dankelmann} et al., J. Comb. Math. Comb. Comput. 26, 131--137 (1998; Zbl 0897.05034)
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
Harary, F.; Oellermann, O. R. The irregularity cost of a graph. (English) Zbl 0901.05086 Comput. Math. Appl. 34, No. 11, 59-63 (1997). Reviewer: A.A.Makhnev (Ekaterinburg) MSC: 05C99 PDFBibTeX XMLCite \textit{F. Harary} and \textit{O. R. Oellermann}, Comput. Math. Appl. 34, No. 11, 59--63 (1997; Zbl 0901.05086) Full Text: DOI
Day, D. P.; Oellermann, Ortrud R.; Swart, Henda C. A characterization of 3-Steiner distance hereditary graphs. (English) Zbl 0888.90140 Networks 30, No. 4, 243-253 (1997). MSC: 90C35 PDFBibTeX XMLCite \textit{D. P. Day} et al., Networks 30, No. 4, 243--253 (1997; Zbl 0888.90140) Full Text: DOI
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
Chartrand, Gary; Hevia, Héctor; Oellermann, Ortrud R. The chromatic number of a factorization of a graph. (English) Zbl 0880.05034 Bull. Inst. Comb. Appl. 20, 33-56 (1997). Reviewer: Ján Plesník (Bratislava) MSC: 05C15 05C70 PDFBibTeX XMLCite \textit{G. Chartrand} et al., Bull. Inst. Comb. Appl. 20, 33--56 (1997; Zbl 0880.05034)
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
Dankelmann, Peter; Oellermann, Ortrud R.; Swart, Henda C. The average Steiner distance of a graph. (English) Zbl 0849.05026 J. Graph Theory 22, No. 1, 15-22 (1996). Reviewer: J.E.Graver (Syracuse) MSC: 05C12 05C05 PDFBibTeX XMLCite \textit{P. Dankelmann} et al., J. Graph Theory 22, No. 1, 15--22 (1996; Zbl 0849.05026) Full Text: DOI
Oellermann, Ortrud R. Connectivity and edge-connectivity in graphs: A survey. (English) Zbl 0905.05044 Congr. Numerantium 116, 231-252 (1996). Reviewer: M.E.Watkins (Syracuse) MSC: 05C40 05-02 PDFBibTeX XMLCite \textit{O. R. Oellermann}, Congr. Numerantium 116, 231--252 (1996; Zbl 0905.05044)
Hind, H. R.; Oellermann, O. Menger-type results for three or more vertices. (English) Zbl 0974.05047 Congr. Numerantium 113, 179-204 (1996). MSC: 05C40 05C35 PDFBibTeX XMLCite \textit{H. R. Hind} and \textit{O. Oellermann}, Congr. Numerantium 113, 179--204 (1996; Zbl 0974.05047)
Henning, Michael A.; Oellermann, Ortrud R.; Swart, Henda C. Local edge domination critical graphs. (English) Zbl 0870.05035 Discrete Math. 161, No. 1-3, 175-184 (1996); erratum ibid. 310, No. 10-11, 1648 (2010). MSC: 05C35 05C75 PDFBibTeX XMLCite \textit{M. A. Henning} et al., Discrete Math. 161, No. 1--3, 175--184 (1996; Zbl 0870.05035) Full Text: DOI
Henning, Michael A.; Oellermann, Ortrud R.; Swart, Henda C. The diversity of domination. (English) Zbl 0870.05034 Discrete Math. 161, No. 1-3, 161-173 (1996). MSC: 05C35 PDFBibTeX XMLCite \textit{M. A. Henning} et al., Discrete Math. 161, No. 1--3, 161--173 (1996; Zbl 0870.05034) Full Text: DOI
Henning, Michael A.; Oellermann, Ortrud R.; Swart, Henda C. Uniquely Steiner-eccentric graphs. (English) Zbl 0845.05034 Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 2. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 1123-1134 (1995). Reviewer: K.R.Parthasarathy (Narayanapuram) MSC: 05C12 05C05 PDFBibTeX XMLCite \textit{M. A. Henning} et al., in: Graph theory, combinatorics, algorithms and applications. Vol. 2. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 1123--1134 (1995; Zbl 0845.05034)
Oellermann, Ortrud R. From Steiner centers to Steiner medians. (English) Zbl 0834.05024 J. Graph Theory 20, No. 2, 113-122 (1995). Reviewer: F.Plastria (Brussels) MSC: 05C12 05C05 05C85 90B80 PDFBibTeX XMLCite \textit{O. R. Oellermann}, J. Graph Theory 20, No. 2, 113--122 (1995; Zbl 0834.05024) Full Text: DOI
Henning, Michael A.; Oellermann, Ortrud R.; Swart, Henda C. Relating pairs of distance domination parameters. (English) Zbl 0830.05039 J. Comb. Math. Comb. Comput. 18, 233-244 (1995). Reviewer: B.Zelinka (Liberec) MSC: 05C35 05C12 PDFBibTeX XMLCite \textit{M. A. Henning} et al., J. Comb. Math. Comb. Comput. 18, 233--244 (1995; Zbl 0830.05039)
Oellermann, Ortrud R. Computing the average distance of a distance hereditary graph in linear time. (English) Zbl 0836.05024 Congr. Numerantium 103, 219-223 (1994). MSC: 05C12 68R10 PDFBibTeX XMLCite \textit{O. R. Oellermann}, Congr. Numerantium 103, 219--223 (1994; Zbl 0836.05024)
Oellermann, Ortrud R. Steiner distance in graphs with emphasis on eccentricity measures: A survey. (English) Zbl 0812.05020 Congr. Numerantium 99, 179-189 (1994). Reviewer: D.Cieslik (Greifswald) MSC: 05C12 05C35 05C05 05-02 PDFBibTeX XMLCite \textit{O. R. Oellermann}, Congr. Numerantium 99, 179--189 (1994; Zbl 0812.05020)
Goddard, Wayne; Oellermann, Ortrud R.; Swart, Henda C. Steiner distance stable graphs. (English) Zbl 0809.05042 Discrete Math. 132, No. 1-3, 65-73 (1994). Reviewer: F.Gliviak (Bratislava) MSC: 05C12 05C85 68Q25 PDFBibTeX XMLCite \textit{W. Goddard} et al., Discrete Math. 132, No. 1--3, 65--73 (1994; Zbl 0809.05042) Full Text: DOI
Day, D. P.; Oellermann, Ortrud R.; Swart, Henda C. Steiner distance-hereditary graphs. (English) Zbl 0805.05021 SIAM J. Discrete Math. 7, No. 3, 437-442 (1994). Reviewer: F.Gliviak (Bratislava) MSC: 05C12 PDFBibTeX XMLCite \textit{D. P. Day} et al., SIAM J. Discrete Math. 7, No. 3, 437--442 (1994; Zbl 0805.05021) Full Text: DOI
Henning, Michael A.; Oellermann, Ortrud R.; Swart, Henda C. Relationships between distance domination parameters. (English) Zbl 0801.05038 Math. Pannonica 5, No. 1, 67-77 (1994). Reviewer: B.Zelinka (Liberec) MSC: 05C35 05C99 05C70 PDFBibTeX XMLCite \textit{M. A. Henning} et al., Math. Pannonica 5, No. 1, 67--77 (1994; Zbl 0801.05038) Full Text: EuDML
Day, D. P.; Oellermann, Ortrud R.; Swart, Henda C. On the \(l\)-connectivity of a digraph. (English) Zbl 0797.05050 Discrete Math. 127, No. 1-3, 95-104 (1994). Reviewer: M.E.Watkins (Syracuse) MSC: 05C20 05C40 PDFBibTeX XMLCite \textit{D. P. Day} et al., Discrete Math. 127, No. 1--3, 95--104 (1994; Zbl 0797.05050) Full Text: DOI
Esfahanian, Abdol-Hossein; Oellermann, Ortrud R. Corrigendum to: Distance-hereditary graphs and multidestination message- routing in multicomputers. (English) Zbl 0802.68096 J. Comb. Math. Comb. Comput. 14, 221 (1993). MSC: 68R10 68M10 05C12 68Q25 PDFBibTeX XMLCite \textit{A.-H. Esfahanian} and \textit{O. R. Oellermann}, J. Comb. Math. Comb. Comput. 14, 221 (1993; Zbl 0802.68096)