default search action
Lucas C. van der Merwe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j19]Johannes H. Hattingh, Osama A. Saleh, Lucas C. van der Merwe, Terry J. Walters:
Nordhaus-Gaddum Results for the Induced Path Number of a Graph When Neither the Graph Nor Its Complement Contains Isolates. Graphs Comb. 32(3): 987-996 (2016) - 2015
- [j18]Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo:
Progress on the Murty-Simon Conjecture on diameter-2 critical graphs: a survey. J. Comb. Optim. 30(3): 579-595 (2015) - 2012
- [j17]Francesco Barioli, Marc Loizeaux, Lucas C. van der Merwe:
On a Family of 4-Critical Graphs with Diameter Three. Ars Comb. 105: 83-93 (2012) - [j16]Michael A. Henning, Lucas C. van der Merwe:
The maximum diameter of total domination edge-critical graphs. Discret. Math. 312(2): 397-404 (2012) - [j15]Abdollah Alimadadi, Changiz Eslahchi, Teresa W. Haynes, Michael A. Henning, Nader Jafari Rad
, Lucas C. van der Merwe:
Erratum to "Total domination supercritical graphs with respect to relative complements" [Discrete Math. 258 (2002) 361-371]. Discret. Math. 312(5): 1076 (2012) - [j14]Johannes H. Hattingh, Nader Jafari Rad
Total edge critical graphs with leaves. Discret. Math. 312(24): 3482-3488 (2012) - [j13]Johannes H. Hattingh, Osama A. Saleh, Lucas C. van der Merwe, Terry J. Walters:
A Nordhaus-Gaddum-type result for the induced path number. J. Comb. Optim. 24(3): 329-338 (2012) - 2011
- [j12]Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo:
On the existence of k-partite or Kp-free total domination edge-critical graphs. Discret. Math. 311(13): 1142-1149 (2011) - [j11]Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo:
On a conjecture of Murty and Simon on diameter 2-critical graphs. Discret. Math. 311(17): 1918-1924 (2011) - 2010
- [j10]Michael A. Henning, Lucas C. van der Merwe:
Properties of total domination edge-critical graphs. Discret. Appl. Math. 158(2): 147-153 (2010)
2000 – 2009
- 2009
- [j9]Johannes H. Hattingh, Ernst J. Joubert, Marc Loizeaux, Andrew R. Plummer, Lucas C. van der Merwe:
Restrained domination in unicyclic graphs. Discuss. Math. Graph Theory 29(1): 71-86 (2009) - [j8]Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
Domination and total domination in complementary prisms. J. Comb. Optim. 18(1): 23-37 (2009) - 2004
- [j7]Wayne Goddard, Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
The diameter of total domination vertex critical graphs. Discret. Math. 286(3): 255-261 (2004) - 2003
- [j6]Lucas C. van der Merwe, Christina M. Mynhardt, Teresa W. Haynes:
Total Domination Edge Critical Graphs with Minimum Diameter. Ars Comb. 66 (2003) - 2002
- [j5]Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
Total domination critical graphs with respect to relative complements. Ars Comb. 64: 169- (2002) - [j4]Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
Total domination supercritical graphs with respect to relative complements. Discret. Math. 258(1-3): 361-371 (2002) - 2001
- [j3]Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
Domination and total domination critical trees with respect to relative complements. Ars Comb. 59 (2001) - [j2]Teresa W. Haynes, Christina M. Mynhardt
Total Domination Edge Critical Graphs with Maximum Diameter. Discuss. Math. Graph Theory 21(2): 187-205 (2001) - [j1]Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, David Pokrass Jacobs, James A. Knisely, Lucas C. van der Merwe:
Domination Subdivision Numbers. Discuss. Math. Graph Theory 21(2): 239-253 (2001)
Coauthor Index
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 2024-04-24 22:54 CEST 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: