Ortrud R. Oellermann (Selection)

Ortrud Oellermann

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

21 David P. Day, Ortrud R. Oellermann, Henda C. Swart: Bounds on the size of graphs of given order and up/down-connectivity. Discrete Mathematics 197-198: 217-223 (1999)

17 David P. Day, Ortrud Oellermann, Henda C. Swart: A characterization of 3-Steiner distance hereditary graphs. Networks 30(4): 243-253 (1997)

11 David P. Day, Ortrud R. Oellermann, Henda C. Swart: On the l-connectivity of a diagraph. Discrete Mathematics 127(1-3): 95-104 (1994)

9 David P. Day, Ortrud Oellermann, Henda C. Swart: Steiner Distance-Hereditary Graphs. SIAM J. Discrete Math. 7(3): 437-442 (1994)

Selection of 4 from 49 records - Ortrud R. Oellermann has 40 coauthors

Last update 2012-09-10 CET by the DBLP Team —

Content released under the ODC-BY 1.0 license — See also our legal information page

21		David P. Day, Ortrud R. Oellermann, Henda C. Swart: Bounds on the size of graphs of given order and up/down-connectivity. Discrete Mathematics 197-198: 217-223 (1999)
17		David P. Day, Ortrud Oellermann, Henda C. Swart: A characterization of 3-Steiner distance hereditary graphs. Networks 30(4): 243-253 (1997)
11		David P. Day, Ortrud R. Oellermann, Henda C. Swart: On the l-connectivity of a diagraph. Discrete Mathematics 127(1-3): 95-104 (1994)
9		David P. Day, Ortrud Oellermann, Henda C. Swart: Steiner Distance-Hereditary Graphs. SIAM J. Discrete Math. 7(3): 437-442 (1994)