Alewyn P. Burger

According to our database1, Alewyn P. Burger authored at least 33 papers between 1997 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Hamilton cycles in sparse locally connected graphs.
Discret. Appl. Math., 2019

2017
The Existence of Planar Hypotraceable Oriented Graphs.
Discret. Math. Theor. Comput. Sci., 2017

Proper connection and size of graphs.
Discret. Math., 2017

2015
Scheduling multi-colour print jobs with sequence-dependent setup times.
J. Sched., 2015

Hypohamiltonian Oriented Graphs of All Possible Orders.
Graphs Comb., 2015

Edge stability in secure graph domination.
Discret. Math. Theor. Comput. Sci., 2015

Edge criticality in secure graph domination.
Discret. Optim., 2015

Destroying longest cycles in graphs and digraphs.
Discret. Appl. Math., 2015

2014
Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs.
Graphs Comb., 2014

A linear algorithm for secure domination in trees.
Discret. Appl. Math., 2014

2013
An Infinite Family of Planar Hypohamiltonian Oriented Graphs.
Graphs Comb., 2013

Further results on Maximal Nontraceable graphs of smallest size.
Discret. Math. Theor. Comput. Sci., 2013

An Iterative Approach to the Traceability Conjecture for Oriented Graphs.
Electron. J. Comb., 2013

2012
An asymptotic analysis of the evolutionary spatial prisoner's dilemma on a path.
Discret. Appl. Math., 2012

2011
Avoidance colourings for small nonclassical Ramsey numbers.
Discret. Math. Theor. Comput. Sci., 2011

A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6.
Discret. Math., 2011

2010
Regular graphs are not universal fixers.
Discret. Math., 2010

Enumeration of isomorphism classes of self-orthogonal Latin squares.
Ars Comb., 2010

2009
On the ratios between packing and domination parameters of a graph.
Discret. Math., 2009

2008
On the (r, s) domination number of a graph.
Ars Comb., 2008

2007
Balanced minimum covers of a finite set.
Discret. Math., 2007

Towards a Characterisation of Lottery Set Overlapping Structures.
Ars Comb., 2007

2005
Altitude of regular graphs with girth at least five.
Discret. Math., 2005

Altitude of small complete and complete bipartite graphs.
Australas. J Comb., 2005

2004
On the domination number of prisms of graphs.
Discuss. Math. Graph Theory, 2004

Ramsey numbers in complete balanced multipartite graphs. Part II: Size numbers.
Discret. Math., 2004

Ramsey numbers in complete balanced multipartite graphs. Part I: Set numbers.
Discret. Math., 2004

2003
An improved upper bound for queens domination numbers.
Discret. Math., 2003

The domination number of the toroidal queens graph of size 3k×3k.
Australas. J Comb., 2003

2002
An upper bound for the minimum number of queens covering the n x n chessboard.
Discret. Appl. Math., 2002

2001
Queens graphs for chessboards on the torus.
Australas. J Comb., 2001

1999
Panel: Global Technologies, Local Cultures: The Case of Virtual Financial Services.
Proceedings of the Seventh European Conference on Information Systems, 1999

1997
Domination and irredundance in the queens' graph.
Discret. Math., 1997


  Loading...