ABAlewyn P. Burger
Alewyn P. Burger
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Alewyn P. Burger has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Jan Harm van Vuuren
Stellenbosch University
4 shared publications - Marietjie Frick
University of South Africa
3 shared publications - Susan A. van Aardt
Department of Mathematical Sciences University of South Africa South Africa
3 shared publications - Arnfried Kemnitz
TU Braunschweig
1 shared publication - Bernardo Llano
Departamento de Matemáticas Universidad Autónoma Metropolitana Iztapalapa (UAM-I) Apartado 55-534 México D.F
1 shared publication - Ingo Schiermeyer
Institut für Diskrete Mathematik und Algebra, Technische Universität Bergakademie Freiberg, Freiberg, Germany
1 shared publication
Latest Publications
- 18 March 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 31 (6) , 1821-1831
Hypohamiltonian Oriented Graphs of All Possible Orders
- 18 March 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 31 (6) , 1821-1831
Hypohamiltonian Oriented Graphs of All Possible Orders
- 14 March 2014
- Published by National Inquiry Services Center (NISC) in Quaestiones Mathematicae
- Vol. 37 (4) , 571-589
The mixed irredundant Ramsey numbers t (3, 7) = 18 and t (3, 8) = 22
- 14 March 2014
- Published by National Inquiry Services Center (NISC) in Quaestiones Mathematicae
- Vol. 37 (4) , 571-589
The mixed irredundant Ramsey numbers t (3, 7) = 18 and t (3, 8) = 22
- Open Access
- 14 October 2013
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 20 (4) , P23
Computational Results on the Traceability of Oriented Graphs of Small Order
A digraph $D$ is traceable if it contains a path visiting every vertex, and hypotraceable if $D$ is not traceable, but $D-v$ is traceable for every vertex $v\in V(D)$. Van Aardt, Frick, Katrenič and Nielsen [Discrete Math. 11(2011), 1273-1280] showed that there exists a hypotraceable oriented graph of order $n$ for every $n\geq 8$, except possibly for $n=9$ or $11$. These two outstanding existence questions for hypotraceable oriented graphs are settled in this paper --- the first in the negative and the second in the affirmative. Furthermore, $D$ is $k$-traceable if $D$ has at least $k$ vertices and each of its induced subdigraphs of order $k$ is traceable. It is known that for $k\leq 6$ every k-traceable oriented graph is traceable and that for $k=7$ and each $k\geq 9$ there exist nontraceable $k$-traceable oriented graphs of order $k+1$. The Traceability Conjecture states that for $k\geq 2$ every $k$-traceable oriented graph of order $n\geq 2k-1$ is traceable. In this paper it is shown via computer searches that all $7$-traceable and $8$-traceable oriented graphs of orders $9$, $10$ and $11$ are traceable, and that all $9$-traceable oriented graphs of order $11$ are traceable. All hypotraceable graphs of order $10$ are also found. Recently, these results are used to prove that the Traceability Conjecture also holds for $k =7, 8$ and 9, except possibly when $k=9$ and $22\leq n\leq 32$.- 14 October 2013
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 20 (4) , P23
Open AccessComputational Results on the Traceability of Oriented Graphs of Small Order
A digraph $D$ is traceable if it contains a path visiting every vertex, and hypotraceable if $D$ is not traceable, but $D-v$ is traceable for every vertex $v\in V(D)$. Van Aardt, Frick, Katrenič and Nielsen [Discrete Math. 11(2011), 1273-1280] showed that there exists a hypotraceable oriented graph of order $n$ for every $n\geq 8$, except possibly for $n=9$ or $11$. These two outstanding existence questions for hypotraceable oriented graphs are settled in this paper --- the first in the negative and the second in the affirmative. Furthermore, $D$ is $k$-traceable if $D$ has at least $k$ vertices and each of its induced subdigraphs of order $k$ is traceable. It is known that for $k\leq 6$ every k-traceable oriented graph is traceable and that for $k=7$ and each $k\geq 9$ there exist nontraceable $k$-traceable oriented graphs of order $k+1$. The Traceability Conjecture states that for $k\geq 2$ every $k$-traceable oriented graph of order $n\geq 2k-1$ is traceable. In this paper it is shown via computer searches that all $7$-traceable and $8$-traceable oriented graphs of orders $9$, $10$ and $11$ are traceable, and that all $9$-traceable oriented graphs of order $11$ are traceable. All hypotraceable graphs of order $10$ are also found. Recently, these results are used to prove that the Traceability Conjecture also holds for $k =7, 8$ and 9, except possibly when $k=9$ and $22\leq n\leq 32$. - 25 April 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (4) , 783-800
Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
- 25 April 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (4) , 783-800
Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
- 1 October 2012
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 160 (15) , 2075-2088
An asymptotic analysis of the evolutionary spatial prisoner’s dilemma on a path
- 1 October 2012
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 160 (15) , 2075-2088
An asymptotic analysis of the evolutionary spatial prisoner’s dilemma on a path
- 6 April 2012
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 29 (4) , 729-733
An Infinite Family of Planar Hypohamiltonian Oriented Graphs
- 6 April 2012
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 29 (4) , 729-733
An Infinite Family of Planar Hypohamiltonian Oriented Graphs
- 6 July 2011
- Published by Elsevier in Discrete Mathematics
- Vol. 311 (13) , 1223-1228
A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6
- 6 July 2011
- Published by Elsevier in Discrete Mathematics
- Vol. 311 (13) , 1223-1228
A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6
- 28 April 2009
- Published by Elsevier in Discrete Mathematics
- Vol. 309 (8) , 2473-2478
On the ratios between packing and domination parameters of a graph
- 28 April 2009
- Published by Elsevier in Discrete Mathematics
- Vol. 309 (8) , 2473-2478
On the ratios between packing and domination parameters of a graph