Christina M. Mynhardt

According to our database1, Christina M. Mynhardt authored at least 87 papers between 1979 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Block graphs with large paired domination multisubdivision number.
Discuss. Math. Graph Theory, 2021

2020
Total Roman domination edge-supercritical and edge-removal-supercritical graphs.
Australas. J Comb., 2020

2019
Connected k-dominating graphs.
Discret. Math., 2019

Subgraph-avoiding minimum decycling sets and k-conversion sets in graphs.
Australas. J Comb., 2019

On k-total dominating graphs.
Australas. J Comb., 2019

2018
The k-conversion number of regular graphs.
CoRR, 2018

2017
Dominating and irredundant broadcasts in graphs.
Discret. Appl. Math., 2017

2016
Triangle decompositions of planar graphs.
Discuss. Math. Graph Theory, 2016

2015
Domination, eternal domination and clique covering.
Discuss. Math. Graph Theory, 2015

More trees with equal broadcast and domination numbers.
Australas. J Comb., 2015

2014
The depression of a graph and <i>k</i>-kernels.
Discuss. Math. Graph Theory, 2014

Independent protection in graphs.
Discret. Math., 2014

A construction of a class of graphs with depression three.
Australas. J Comb., 2014

2013
A class of graphs with depression three.
Discret. Math., 2013

A class of trees with equal broadcast and domination numbers.
Australas. J Comb., 2013

2012
Characterizing Cartesian fixers and multipliers.
Discuss. Math. Graph Theory, 2012

Vertex covers and eternal dominating sets.
Discret. Appl. Math., 2012

Eternal Total Domination in Graphs.
Ars Comb., 2012

2011
Paired domination in prisms of graphs.
Discuss. Math. Graph Theory, 2011

Graphs with equal eternal vertex cover and eternal domination numbers.
Discret. Math., 2011

Broadcasts and domination in trees.
Discret. Math., 2011

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

Domination of generalized Cartesian products.
Discret. Math., 2010

2009
Radial trees.
Discret. Math., 2009

Secure domination critical graphs.
Discret. Math., 2009

Claw-free graphs are not universal fixers.
Discret. Math., 2009

Edge protection in graphs.
Australas. J Comb., 2009

2008
Secure domination and secure total domination in graphs.
Discuss. Math. Graph Theory, 2008

Trees with depression three.
Discret. Math., 2008

Open irredundance and maximum degree in graphs.
Discret. Math., 2008

Maximal Nontraceable Graphs with Toughness less than One.
Electron. J. Comb., 2008

Diameter of paired domination edge-critical graphs.
Australas. J Comb., 2008

Trees with domination subdivision number one.
Australas. J Comb., 2008

2007
Couterexample to a conjecture on the structure of bipartite partionable graphs.
Discuss. Math. Graph Theory, 2007

2006
Construction of trees and graphs with equal domination parameters.
Discret. Math., 2006

A lower bound for the depression of trees.
Australas. J Comb., 2006

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

On i<sup>-</sup>-ER-critical graphs.
Discret. Math., 2004

Total domination in Kr-covered graphs.
Ars Comb., 2004

2003
Upper bounds for the domination numbers of toroidal queens graphs.
Discuss. Math. Graph Theory, 2003

Vertices contained in all or in no minimum total dominating set of a tree.
Discret. Math., 2003

Changing upper irredundance by edge addition.
Discret. Math., 2003

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

Total Domination Edge Critical Graphs with Minimum Diameter.
Ars Comb., 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
Vertex criticality for upper domination and irredundance.
J. Graph Theory, 2001

Total Domination Edge Critical Graphs with Maximum Diameter.
Discuss. Math. Graph Theory, 2001

Domination parameters and edge-removal-critical graphs.
Discret. Math., 2001

Ramsey properties of generalised irredundant sets in graphs.
Discret. Math., 2001

Generalised Ramsey Numbers with respect to Classes of Graphs.
Ars Comb., 2001

Properties of Queens graphs and the irredundance number of Q<sub>7</sub>.
Australas. J Comb., 2001

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

2000
Total domination in graphs with minimum degree three.
J. Graph Theory, 2000

A characterization of (γ, <i>i</i>)-trees.
J. Graph Theory, 2000

On i-minus-Edge-Removal-critical graphs.
Electron. Notes Discret. Math., 2000

Nordhaus-Gaddum results for CO-irredundance in graphs.
Discret. Math., 2000

1999
Vertices contained in every minimum dominating set of a tree.
J. Graph Theory, 1999

On 1-dependent ramsey numbers for graphs.
Discuss. Math. Graph Theory, 1999

1998
An inequality chain of domination parameters for trees.
Discuss. Math. Graph Theory, 1998

Irredundant and perfect neighbourhood sets in trees.
Discret. Math., 1998

Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs.
Australas. J Comb., 1998

1997
On equality in an upper bound for domination parameters of graphs.
J. Graph Theory, 1997

Domination and irredundance in cubic graphs.
Discret. Math., 1997

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

Irredundance and Maximum Degree in Graphs.
Comb. Probab. Comput., 1997

On Graphs With a Unique Least Common Multiple.
Ars Comb., 1997

1996
Domination critical graphs with higher independent domination numbers.
J. Graph Theory, 1996

Universal maximal packing functions of graphs.
Discret. Math., 1996

On the sizes of least common multiples of several pairs of graphs.
Ars Comb., 1996

On a generalization of signed dominating functions of graphs.
Ars Comb., 1996

1995
Total dominating functions in trees: Minimality and convexity.
J. Graph Theory, 1995

A characterisation of universal minimal total dominating functions in trees.
Discret. Math., 1995

On a Nordhaus-Gaddum type problem for independent domination.
Discret. Math., 1995

Properties of minimal dominating functions of graphs.
Ars Comb., 1995

1994
Universal minimal total dominating functions in graphs.
Networks, 1994

Convexity of minimal dominating functions of trees - II.
Discret. Math., 1994

1993
The sequence of upper and lower domination, independence and irredundance numbers of a graph.
Discret. Math., 1993

1991
Lower Ramsey numbers for graphs.
Discret. Math., 1991

1990
On generalised minimal domination parameters for paths.
Discret. Math., 1990

1989
Irredundant ramsey numbers for graphs.
J. Graph Theory, 1989

On the product of upper irredundance numbers of a graph and its complement.
Discret. Math., 1989

1985
Degree sets of degree uniform graphs.
Graphs Comb., 1985

1980
G-constructibility of planar graphs.
J. Graph Theory, 1980

1979
Remarks on the critical graph conjecture.
Discret. Math., 1979


  Loading...