default search action
Alewyn P. Burger
Person information
- affiliation: University of Stellenbosch, Matieland, South Africa
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j33]Alewyn P. Burger, Johan P. de Wet
, Marietjie Frick
Planar hypohamiltonian oriented graphs. J. Graph Theory 100(1): 50-68 (2022)
2010 – 2019
- 2019
- [j32]Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Carsten Thomassen
Hamilton cycles in sparse locally connected graphs. Discret. Appl. Math. 257: 276-288 (2019) - 2017
- [j31]Susan A. van Aardt, Christoph Brause, Alewyn P. Burger, Marietjie Frick
Proper connection and size of graphs. Discret. Math. 340(11): 2673-2677 (2017) - [j30]Susan A. van Aardt, Alewyn Petrus Burger, Marietjie Frick:
The Existence of Planar Hypotraceable Oriented Graphs. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - 2015
- [j29]Susan A. van Aardt, Alewyn P. Burger, Jean E. Dunbar, Marietjie Frick
Destroying longest cycles in graphs and digraphs. Discret. Appl. Math. 186: 251-259 (2015) - [j28]Alewyn P. Burger, Anton Pierre de Villiers, Jan H. van Vuuren
Edge criticality in secure graph domination. Discret. Optim. 18: 111-122 (2015) - [j27]Anton Pierre de Villiers, Alewyn Petrus Burger, Jan Harm van Vuuren:
Edge stability in secure graph domination. Discret. Math. Theor. Comput. Sci. 17(1): 103-122 (2015) - [j26]Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick
Hypohamiltonian Oriented Graphs of All Possible Orders. Graphs Comb. 31(6): 1821-1831 (2015) - [j25]Alewyn P. Burger, C. G. Jacobs, Jan H. van Vuuren
Scheduling multi-colour print jobs with sequence-dependent setup times. J. Sched. 18(2): 131-145 (2015) - 2014
- [j24]Alewyn P. Burger, Anton Pierre de Villiers, Jan H. van Vuuren
A linear algorithm for secure domination in trees. Discret. Appl. Math. 171: 15-27 (2014) - [j23]Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick
Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs. Graphs Comb. 30(4): 783-800 (2014) - 2013
- [j22]Susan A. van Aardt, Alewyn P. Burger, Jean E. Dunbar, Marietjie Frick, John Harris, Joy Singleton:
An Iterative Approach to the Traceability Conjecture for Oriented Graphs. Electron. J. Comb. 20(1): 59 (2013) - [j21]Joy Elizabeth Singleton, Alewyn Petrus Burger:
Further results on Maximal Nontraceable graphs of smallest size. Discret. Math. Theor. Comput. Sci. 15(1): 75-92 (2013) - [j20]Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick
An Infinite Family of Planar Hypohamiltonian Oriented Graphs. Graphs Comb. 29(4): 729-733 (2013) - 2012
- [j19]Alewyn P. Burger, M. van der Merwe, Jan H. van Vuuren
An asymptotic analysis of the evolutionary spatial prisoner's dilemma on a path. Discret. Appl. Math. 160(15): 2075-2088 (2012) - 2011
- [j18]Alewyn P. Burger, Martin Philip Kidd, Jan H. van Vuuren
A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6. Discret. Math. 311(13): 1223-1228 (2011) - [j17]Alewyn P. Burger, Jan H. van Vuuren:
Avoidance colourings for small nonclassical Ramsey numbers. Discret. Math. Theor. Comput. Sci. 13(2): 81-96 (2011) - 2010
- [j16]Alewyn P. Burger, Martin Philip Kidd, Jan H. van Vuuren:
Enumeration of isomorphism classes of self-orthogonal Latin squares. Ars Comb. 97 (2010) - [j15]Alewyn P. Burger, Christina M. Mynhardt
Regular graphs are not universal fixers. Discret. Math. 310(2): 364-368 (2010)
2000 – 2009
- 2009
- [j14]Alewyn P. Burger, Michael A. Henning, Jan H. van Vuuren
On the ratios between packing and domination parameters of a graph. Discret. Math. 309(8): 2473-2478 (2009) - 2008
- [j13]Alewyn P. Burger, Jan H. van Vuuren:
On the (r, s) domination number of a graph. Ars Comb. 88 (2008) - 2007
- [j12]Alewyn P. Burger, W. R. Grundlingh, Jan H. van Vuuren:
Towards a Characterisation of Lottery Set Overlapping Structures. Ars Comb. 84 (2007) - [j11]Alewyn P. Burger, Jan H. van Vuuren
Balanced minimum covers of a finite set. Discret. Math. 307(22): 2853-2860 (2007) - 2005
- [j10]Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt:
Altitude of small complete and complete bipartite graphs. Australas. J Comb. 31: 167-178 (2005) - [j9]Christina M. Mynhardt
Altitude of regular graphs with girth at least five. Discret. Math. 294(3): 241-257 (2005) - 2004
- [j8]Alewyn P. Burger, Jan H. van Vuuren
Ramsey numbers in complete balanced multipartite graphs. Part I: Set numbers. Discret. Math. 283(1-3): 37-43 (2004) - [j7]Alewyn P. Burger, Jan H. van Vuuren
Ramsey numbers in complete balanced multipartite graphs. Part II: Size numbers. Discret. Math. 283(1-3): 45-59 (2004) - [j6]Alewyn P. Burger, Christina M. Mynhardt
On the domination number of prisms of graphs. Discuss. Math. Graph Theory 24(2): 303-318 (2004) - 2003
- [j5]Alewyn P. Burger, Christina M. Mynhardt, William D. Weakley:
The domination number of the toroidal queens graph of size 3k×3k. Australas. J Comb. 28: 137-148 (2003) - [j4]Alewyn P. Burger, Christina M. Mynhardt
An improved upper bound for queens domination numbers. Discret. Math. 266(1-3): 119-131 (2003) - 2002
- [j3]Alewyn P. Burger, Christina M. Mynhardt
An upper bound for the minimum number of queens covering the n x n chessboard. Discret. Appl. Math. 121(1-3): 51-60 (2002) - 2001
- [j2]Alewyn P. Burger, Christina M. Mynhardt, Ernest J. Cockayne:
Queens graphs for chessboards on the torus. Australas. J Comb. 24: 231-246 (2001)
1990 – 1999
- 1999
- [c1]Faith Noble, Alewyn P. Burger, Anders Henten, Kalle Lyytinen, Frank Seifert, Andrea Carignani:
Panel: Global Technologies, Local Cultures: The Case of Virtual Financial Services. ECIS 1999: 1028-1031 - 1997
- [j1]Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt
Domination and irredundance in the queens' graph. Discret. Math. 163(1-3): 47-66 (1997)
Coauthor Index
aka: Jan Harm van Vuuren
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: