default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErnst J. Joubert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j23]Ernst J. Joubert:
Bipartite Ramsey number pairs that involve combinations of cycles and odd paths. Discret. Math. 348(2): 114283 (2025)- 2024
- [j22]Ernst J. Joubert, Michael A. Henning:
On the cycle-path bipartite Ramsey number. Discret. Math. 347(2): 113759 (2024)
2010 – 2019
- 2019
- [j21]Ernst J. Joubert
:
On a conjecture involving a bound for the total restrained domination number of a graph. Discret. Appl. Math. 258: 177-187 (2019) - 2018
- [j20]Johannes H. Hattingh, Ernst J. Joubert:
Some multicolor bipartite Ramsey numbers involving cycles and a small number of colors. Discret. Math. 341(5): 1325-1330 (2018) - 2017
- [j19]Ernst J. Joubert:
Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars. Discret. Appl. Math. 227: 95-102 (2017) - [j18]Ernst J. Joubert:
Some Generalized Bipartite Ramsey Numbers Involving Short Cycles. Graphs Comb. 33(2): 433-448 (2017) - 2016
- [j17]Ernst J. Joubert:
An inequality that relates the size of a bipartite graph with its order and restrained domination number. J. Comb. Optim. 31(1): 44-51 (2016) - [j16]Johannes H. Hattingh, Ernst J. Joubert:
Equality in a bound that relates the size and the restrained domination number of a graph. J. Comb. Optim. 31(4): 1586-1608 (2016) - 2014
- [j15]Johannes H. Hattingh, Ernst J. Joubert:
Some Bistar Bipartite Ramsey Numbers. Graphs Comb. 30(5): 1175-1181 (2014) - 2013
- [j14]Ernst J. Joubert:
Maximum sizes of graphs with given restrained domination numbers. Discret. Appl. Math. 161(6): 829-837 (2013) - [j13]Michael A. Henning, Ernst J. Joubert:
Equality in a linear Vizing-like relation that relates the size and total domination number of a graph. Discret. Appl. Math. 161(13-14): 2014-2024 (2013) - 2012
- [j12]Michael A. Henning, Ernst J. Joubert, Justin Southey:
Multiple factor Nordhaus-Gaddum type results for domination and total domination. Discret. Appl. Math. 160(7-8): 1137-1142 (2012) - 2011
- [j11]Michael A. Henning, Ernst J. Joubert, Justin Southey:
Nordhaus-Gaddum bounds for total domination. Appl. Math. Lett. 24(6): 987-990 (2011) - [j10]Ernst J. Joubert:
Total restrained domination in claw-free graphs with minimum degree at least two. Discret. Appl. Math. 159(17): 2078-2097 (2011) - [j9]Michael A. Henning, Ernst J. Joubert, Justin Southey:
Nordhaus-Gaddum Type Results for Total Domination. Discret. Math. Theor. Comput. Sci. 13(3): 87-96 (2011) - [j8]Johannes H. Hattingh, Ernst J. Joubert:
Restrained domination in cubic graphs. J. Comb. Optim. 22(2): 166-179 (2011) - 2010
- [j7]Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert:
Bounds on the Total Restrained Domination Number of a Graph. Graphs Comb. 26(1): 77-93 (2010) - [j6]Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert:
An upper bound on the total restrained domination number of a tree. J. Comb. Optim. 20(3): 205-223 (2010)
2000 – 2009
- 2009
- [j5]Johannes H. Hattingh, Ernst J. Joubert:
An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree. Discret. Appl. Math. 157(13): 2846-2858 (2009) - [j4]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) - [j3]Johannes H. Hattingh, Ernst J. Joubert:
Restrained Domination in Claw-Free Graphs with Minimum Degree at Least Two. Graphs Comb. 25(5): 693-706 (2009) - 2008
- [j2]Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert, Andrew R. Plummer:
Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs. Discret. Math. 308(7): 1080-1087 (2008) - 2007
- [j1]Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert, Andrew R. Plummer:
Total restrained domination in trees. Discret. Math. 307(13): 1643-1650 (2007)
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-10-25 21:12 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:
