Ortrud R. Oellermann

63 papers Journal 62

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	On the Strong Path Partition Conjecture. Discuss. Math. Graph Theory Johan P. de Wet, Jean E. Dunbar, Marietjie Frick, Ortrud R. Oellermann
2023	J	`jnl`	Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs. Discuss. Math. Graph Theory MacKenzie Carr, Christina M. Mynhardt, Ortrud R. Oellermann
2023	J	`jnl`	The threshold dimension and irreducible graphs. Discuss. Math. Graph Theory Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
2022	J	`jnl`	On the average (edge-)connectivity of minimally k-(edge-)connected graphs. Bull. ICA Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal
2021	J	`jnl`	Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs. Discret. Appl. Math. Rocío M. Casablanca, Lucas Mol, Ortrud R. Oellermann
2021	J	`jnl`	On the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs. CoRR Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal
2021	J	`jnl`	The threshold strong dimension of a graph. Discret. Math. Nadia Benakli, Novi H. Bong, Shonda Dueck, Linda Eroh, Beth Novick, Ortrud R. Oellermann
2020	J	`jnl`	On the mean order of connected induced subgraphs of block graphs. Australas. J Comb. Kristaps J. Balodis, Lucas Mol, Ortrud R. Oellermann, Matthew E. Kroeker
2020	J	`jnl`	The Threshold Dimension and Irreducible Graphs. CoRR Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
2020	J	`jnl`	The threshold dimension of a graph. Discret. Appl. Math. Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
2019	J	`jnl`	Maximizing the mean subtree order. J. Graph Theory Lucas Mol, Ortrud R. Oellermann
2018	J	`jnl`	On the mean connected induced subgraph order of cographs. Australas. J Comb. Matthew E. Kroeker, Lucas Mol, Ortrud R. Oellermann
2018	J	`jnl`	On the roots of Wiener polynomials of graphs. Discret. Math. Jason I. Brown, Lucas Mol, Ortrud R. Oellermann
2018	J	`jnl`	The mean order of sub-k-trees of k-trees. J. Graph Theory Alexander M. Stephens, Ortrud R. Oellermann
2017	J	`jnl`	Comparing the metric and strong dimensions of graphs. Discret. Appl. Math. Gaia Moravcik, Ortrud R. Oellermann, Samuel Yusim
2017	J	`jnl`	On Saito's Conjecture and the Oberly-Sumner Conjectures. Graphs Comb. Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Ortrud R. Oellermann, Johan P. de Wet
2017	J	`jnl`	Reconstructing trees from digitally convex sets. Discret. Appl. Math. Philip Lafrance, Ortrud R. Oellermann, Timothy Pressey
2016	J	`jnl`	Generating and Enumerating Digitally Convex Sets of Trees. Graphs Comb. Philip Lafrance, Ortrud R. Oellermann, Timothy Pressey
2016	J	`jnl`	Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs. Discret. Appl. Math. Susan A. van Aardt, Marietjie Frick, Ortrud R. Oellermann, Johan P. de Wet
2016	J	`jnl`	Global cycle properties of locally isometric graphs. Discret. Appl. Math. Adam Borchert, Skylar Nicol, Ortrud R. Oellermann
2016	J	`jnl`	The simultaneous metric dimension of graph families. Discret. Appl. Math. Yunior Ramírez-Cruz, Ortrud R. Oellermann, Juan A. Rodríguez-Velázquez
2015	J	`jnl`	On the spectrum and number of convex sets in graphs. Discret. Math. Jason I. Brown, Ortrud R. Oellermann
2014	J	`jnl`	Graphs with a Minimal Number of Convex Sets. Graphs Comb. Jason I. Brown, Ortrud R. Oellermann
2014	J	`jnl`	On the strong metric dimension of Cartesian and direct products of graphs. Discret. Math. Juan Alberto Rodríguez-Velázquez, Ismael González Yero, Dorota Kuziak, Ortrud R. Oellermann
2014	J	`jnl`	Simultaneous Resolvability in Graph Families. Electron. Notes Discret. Math. Yunior Ramírez-Cruz, Ortrud R. Oellermann, Juan Alberto Rodríguez-Velázquez
2012	J	`jnl`	Minimal trees and monophonic convexity. Discuss. Math. Graph Theory José Cáceres, Ortrud R. Oellermann, María Luz Puertas
2012	J	`jnl`	Separation properties of 3-Steiner and 3-monophonic convexity in graphs. Discret. Math. Morten Hegner Nielsen, Ortrud R. Oellermann
2011	—	`ch.`	Distance in Graphs. Structural Analysis of Complex Networks Wayne Goddard, Ortrud R. Oellermann
2011	J	`jnl`	Hamiltonicity of Electron. J. Comb. Frank Bullock, Peter Dankelmann, Marietjie Frick, Michael A. Henning, Ortrud R. Oellermann, Susan A. van Aardt
2011	J	`jnl`	Helly theorems for 3-Steiner and 3-monophonic convexity in graphs. Discret. Math. Morten Hegner Nielsen, Ortrud R. Oellermann
2010	J	`jnl`	Traceability of k-traceable oriented graphs. Discret. Math. Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Peter Katrenic, Morten Hegner Nielsen, Ortrud R. Oellermann
2009	J	`jnl`	Local Steiner convexity. Eur. J. Comb. Michael A. Henning, Morten Hegner Nielsen, Ortrud R. Oellermann
2009	J	`jnl`	On 3-Steiner simplicial orderings. Discret. Math. José Cáceres, Ortrud R. Oellermann
2009	J	`jnl`	Steiner Trees and Convex Geometries. SIAM J. Discret. Math. Morten Hegner Nielsen, Ortrud R. Oellermann
2008	J	`jnl`	A Traceability Conjecture for Oriented Graphs. Electron. J. Comb. Marietjie Frick, Susan A. van Aardt, Jean E. Dunbar, Morten Hegner Nielsen, Ortrud R. Oellermann
2008	J	`jnl`	Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs. Discret. Math. Linda Eroh, Ortrud R. Oellermann
2007	J	`jnl`	Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs. Discret. Math. Ortrud R. Oellermann, María Luz Puertas
2007	J	`jnl`	The strong metric dimension of graphs and digraphs. Discret. Appl. Math. Ortrud R. Oellermann, Joel Peters-Fransen
2006	J	`jnl`	The Metric Dimension of Cayley Digraphs of Abelian Groups. Ars Comb. Ortrud R. Oellermann, Charlene D. Pawluck, Anna Stokke
2006	J	`jnl`	The metric dimension of Cayley digraphs. Discret. Math. Melodie Fehr, Shonda Gosselin, Ortrud R. Oellermann
2005	J	`jnl`	Degree Sequences of Optimally Edge-Connected Multigraphs. Ars Comb. Peter Dankelmann, Ortrud R. Oellermann
2005	J	`jnl`	Rebuilding convex sets in graphs. Discret. Math. José Cáceres, Alberto Márquez, Ortrud R. Oellermann, María Luz Puertas
2005	J	`jnl`	The directed path partition conjecture. Discuss. Math. Graph Theory Marietjie Frick, Susan A. van Aardt, Gcina Dlamini, Jean E. Dunbar, Ortrud R. Oellermann
2001	J	`jnl`	The average connectivity of regular multipartite tournaments. Australas. J Comb. Michael A. Henning, Ortrud R. Oellermann
2000	J	`jnl`	Bipartite Ramsey numbers and Zarankiewicz numbers. Discret. Math. Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann
1999	J	`jnl`	Bounds on the size of graphs of given order and up/down-connectivity. Discret. Math. David P. Day, Ortrud R. Oellermann, Henda C. Swart
1996	J	`jnl`	Local edge domination critical graphs. Discret. Math. Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart
1996	J	`jnl`	The average Steiner distance of a graph. J. Graph Theory Peter Dankelmann, Ortrud R. Oellermann, Henda C. Swart
1996	J	`jnl`	The diversity of domination. Discret. Math. Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart
1995	J	`jnl`	From steiner centers to steiner medians. J. Graph Theory Ortrud R. Oellermann
1994	J	`jnl`	On the l-connectivity of a diagraph. Discret. Math. David P. Day, Ortrud R. Oellermann, Henda C. Swart
1994	J	`jnl`	Steiner distance stable graphs. Discret. Math. Wayne Goddard, Ortrud R. Oellermann, Henda C. Swart
1991	J	`jnl`	Conditional graph connectivity relative to hereditary properties. Networks Ortrud R. Oellermann
1991	J	`jnl`	On multipartite tournaments. J. Comb. Theory B Wayne Goddard, Grzegorz Kubicki, Ortrud R. Oellermann, Songlin Tian
1990	J	`jnl`	Steiner centers in graphs. J. Graph Theory Ortrud R. Oellermann, Songlin Tian
1989	J	`jnl`	Greatest common subgraphs with specified properties. Graphs Comb. Gary Chartrand, Ortrud R. Oellermann, Farrokh Saba, Hung Bin Zou
1988	J	`jnl`	The connected cutset connectivity of a graph. Discret. Math. Ortrud R. Oellermann
1987	J	`jnl`	Highly irregular graphs. J. Graph Theory Yousef Alavi, Gary Chartrand, Fan R. K. Chung, Paul Erdös, Ronald L. Graham, Ortrud R. Oellermann
1987	J	`jnl`	On the Graphs Comb. Ortrud R. Oellermann
1986	J	`jnl`	An Eulerian exposition. J. Graph Theory Linda M. Lesniak, Ortrud R. Oellermann
1986	J	`jnl`	Bipartite regulation numbers. Discret. Math. Yousef Alavi, Gary Chartrand, Ortrud R. Oellermann, Linda M. Lesniak
1985	J	`jnl`	On the regulation number of a multigraph. Graphs Comb. Gary Chartrand, Frank Harary, Ortrud R. Oellermann
1985	J	`jnl`	Randomly Graphs Comb. Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz