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)
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
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)
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
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)
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
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
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)
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)
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
Goddard, Wayne; Henning, Michael A.; Oellermann, Ortrud R.; Swart, Henda C. Some general aspects of the framing number of a graph. (English) Zbl 0794.05123 Quaest. Math. 16, No. 3, 289-300 (1993). Reviewer: H.-J.Presia (Ilmenau) MSC: 05C99 PDFBibTeX XMLCite \textit{W. Goddard} et al., Quaest. Math. 16, No. 3, 289--300 (1993; Zbl 0794.05123) Full Text: DOI
Goddard, Wayne; Henning, Michael A.; Oellermann, Ortrud R.; Swart, Henda C. Which trees are uniquely framed by the Heawood graph. (English) Zbl 0794.05122 Quaest. Math. 16, No. 3, 237-251 (1993). Reviewer: H.-J.Presia (Ilmenau) MSC: 05C99 05C75 05C05 PDFBibTeX XMLCite \textit{W. Goddard} et al., Quaest. Math. 16, No. 3, 237--251 (1993; Zbl 0794.05122) Full Text: DOI
Day, D. P.; Oellermann, Ortrud R.; Swart, Henda C. On the \(l\)-connectivity function of caterpillars and complete multipartite graphs. (English) Zbl 0760.05062 J. Comb. Math. Comb. Comput. 10, 183-192 (1991). Reviewer: P.Horak (Bratislava) MSC: 05C40 PDFBibTeX XMLCite \textit{D. P. Day} et al., J. Comb. Math. Comb. Comput. 10, 183--192 (1991; Zbl 0760.05062)
Henning, Michael A.; Oellermann, Ortrud R.; Swart, Henda C. On vertices with maximum Steiner eccentricity in graphs. (English) Zbl 0735.05035 Graph theory, combinatorics, algorithms, and applications, Proc. 2nd Int. Conf., San Francisco/CA (USA) 1989, 393-403 (1991). MSC: 05C12 05C35 PDFBibTeX XMLCite \textit{M. A. Henning} et al., in: Existence theorems for nonseparable \(\alpha\)-valuations of snakes. . 393--403 (1991; Zbl 0735.05035)
Henning, M. A.; Oellermann, Ortrud R.; Swart, Henda C. Bounds on distance domination parameters. (English) Zbl 0766.05040 J. Comb. Inf. Syst. Sci. 16, No. 1, 11-18 (1991). MSC: 05C35 05C99 PDFBibTeX XMLCite \textit{M. A. Henning} et al., J. Comb. Inf. Syst. Sci. 16, No. 1, 11--18 (1991; Zbl 0766.05040)
Oellermann, Ortrud R.; Swart, Henda C. On the Steiner periphery and Steiner eccentricity of a graph. (English) Zbl 0697.05036 Topics in combinatorics and graph theory. Essays in honour of Gerhard Ringel, 541-547 (1990). MSC: 05C35 PDFBibTeX XML
Goddard, Wayne; Oellermann, Ortrud R.; Swart, Henda C. A new approach to distance stable graphs. (English) Zbl 0755.05034 J. Comb. Math. Comb. Comput. 8, 209-220 (1990). MSC: 05C12 PDFBibTeX XMLCite \textit{W. Goddard} et al., J. Comb. Math. Comb. Comput. 8, 209--220 (1990; Zbl 0755.05034)
Chartrand, Gary; Oellermann, Ortrud R.; Swart, Henda C. Degree representative trees in graphs. (English) Zbl 0674.05036 Graph theory, 250th Anniv. Conf., Lafayette/Indiana 1986, Congr. Numerantium 64, 73-79 (1988). Reviewer: J.W.Moon MSC: 05C35 05C05 PDFBibTeX XML
Chartrand, Gary; Holbert, Karen S.; Oellermann, Ortrud R.; Swart, Henda C. \(F\)-degrees in graphs. (English) Zbl 0643.05055 Ars Comb. 24, 133-148 (1987). Reviewer: R.Bodendiek MSC: 05C99 05C75 PDFBibTeX XMLCite \textit{G. Chartrand} et al., Ars Comb. 24, 133--148 (1987; Zbl 0643.05055)
Oellermann, Ortrud R.; Swart, Henda C. Graphs for which all strong orientations are Eulerian. (English) Zbl 0533.05040 Expo. Math. 2, 183-184 (1984). Reviewer: J.W.Moon MSC: 05C45 05C20 PDFBibTeX XMLCite \textit{O. R. Oellermann} and \textit{H. C. Swart}, Expo. Math. 2, 183--184 (1984; Zbl 0533.05040)