Ernst J. Joubert

Orcid: 0000-0002-6848-9194

According to our database1, Ernst J. Joubert authored at least 22 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the cycle-path bipartite Ramsey number.
Discret. Math., February, 2024

2019
On a conjecture involving a bound for the total restrained domination number of a graph.
Discret. Appl. Math., 2019

2018
Some multicolor bipartite Ramsey numbers involving cycles and a small number of colors.
Discret. Math., 2018

2017
Some Generalized Bipartite Ramsey Numbers Involving Short Cycles.
Graphs Comb., 2017

Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars.
Discret. Appl. Math., 2017

2016
An inequality that relates the size of a bipartite graph with its order and restrained domination number.
J. Comb. Optim., 2016

Equality in a bound that relates the size and the restrained domination number of a graph.
J. Comb. Optim., 2016

2014
Some Bistar Bipartite Ramsey Numbers.
Graphs Comb., 2014

2013
Maximum sizes of graphs with given restrained domination numbers.
Discret. Appl. Math., 2013

Equality in a linear Vizing-like relation that relates the size and total domination number of a graph.
Discret. Appl. Math., 2013

2012
Multiple factor Nordhaus-Gaddum type results for domination and total domination.
Discret. Appl. Math., 2012

2011
Restrained domination in cubic graphs.
J. Comb. Optim., 2011

Nordhaus-Gaddum Type Results for Total Domination.
Discret. Math. Theor. Comput. Sci., 2011

Total restrained domination in claw-free graphs with minimum degree at least two.
Discret. Appl. Math., 2011

Nordhaus-Gaddum bounds for total domination.
Appl. Math. Lett., 2011

2010
An upper bound on the total restrained domination number of a tree.
J. Comb. Optim., 2010

Bounds on the Total Restrained Domination Number of a Graph.
Graphs Comb., 2010

2009
Restrained Domination in Claw-Free Graphs with Minimum Degree at Least Two.
Graphs Comb., 2009

Restrained domination in unicyclic graphs.
Discuss. Math. Graph Theory, 2009

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., 2009

2008
Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs.
Discret. Math., 2008

2007
Total restrained domination in trees.
Discret. Math., 2007


  Loading...