Christina M. Mynhardt

According to our database, Christina M. Mynhardt authored at least 91 papers between 1979 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs.

MacKenzie Carr, Christina M. Mynhardt, Ortrud R. Oellermann

Discuss. Math. Graph Theory, 2023

2022

Eternal domination and clique covering.

Gary MacGillivray, Christina M. Mynhardt, Virgélot Virgile

Electron. J. Graph Theory Appl., 2022

Irredundance trees of diameter 3.

Christina M. Mynhardt, Adriana Roux

Discret. Math., 2022

Irredundance graphs.

Christina M. Mynhardt, Adriana Roux

Discret. Appl. Math., 2022

2021

Block graphs with large paired domination multisubdivision number.

Christina M. Mynhardt, Joanna Raczek

Discuss. Math. Graph Theory, 2021

2020

The k-conversion number of regular graphs.

Christina M. Mynhardt, Jane L. Wodlinger

AKCE Int. J. Graphs Comb., 2020

Total Roman domination edge-supercritical and edge-removal-supercritical graphs.

Christina M. Mynhardt, S. E. A. Ogden

Australas. J Comb., 2020

2019

Connected k-dominating graphs.

Christina M. Mynhardt, L. E. Teshima, Adriana Roux

Discret. Math., 2019

Subgraph-avoiding minimum decycling sets and k-conversion sets in graphs.

M. D. Francis, Christina M. Mynhardt, Jane L. Wodlinger

Australas. J Comb., 2019

On k-total dominating graphs.

Saeid Alikhani, Davood Fatehi, Christina M. Mynhardt

Australas. J Comb., 2019

2017

Dominating and irredundant broadcasts in graphs.

Christina M. Mynhardt, Adriana Roux

Discret. Appl. Math., 2017

2016

Triangle decompositions of planar graphs.

Christina M. Mynhardt, Christopher M. van Bommel

Discuss. Math. Graph Theory, 2016

2015

Domination, eternal domination and clique covering.

William F. Klostermeyer, Christina M. Mynhardt

Discuss. Math. Graph Theory, 2015

More trees with equal broadcast and domination numbers.

S. Lunney, Christina M. Mynhardt

Australas. J Comb., 2015

2014

The depression of a graph and <i>k</i>-kernels.

Christina M. Mynhardt, Mark Schurch

Discuss. Math. Graph Theory, 2014

Independent protection in graphs.

Bert L. Hartnell, Christina M. Mynhardt

Discret. Math., 2014

A construction of a class of graphs with depression three.

Christina M. Mynhardt, Mark Schurch

Australas. J Comb., 2014

2013

A class of graphs with depression three.

Christina M. Mynhardt, Mark Schurch

Discret. Math., 2013

A class of trees with equal broadcast and domination numbers.

Christina M. Mynhardt, Jane Wodlinger

Australas. J Comb., 2013

2012

Characterizing Cartesian fixers and multipliers.

Stephen Benecke, Christina M. Mynhardt

Discuss. Math. Graph Theory, 2012

Vertex covers and eternal dominating sets.

William Klostermeyer, Christina M. Mynhardt

Discret. Appl. Math., 2012

Eternal Total Domination in Graphs.

William Klostermeyer, Christina M. Mynhardt

Ars Comb., 2012

2011

Paired domination in prisms of graphs.

Christina M. Mynhardt, Mark Schurch

Discuss. Math. Graph Theory, 2011

Graphs with equal eternal vertex cover and eternal domination numbers.

William Klostermeyer, Christina M. Mynhardt

Discret. Math., 2011

Broadcasts and domination in trees.

Ernest J. Cockayne, Sarada Herke, Christina M. Mynhardt

Discret. Math., 2011

2010

Regular graphs are not universal fixers.

Alewyn P. Burger, Christina M. Mynhardt

Discret. Math., 2010

Domination of generalized Cartesian products.

Stephen Benecke, Christina M. Mynhardt

Discret. Math., 2010

2009

Radial trees.

Sarada Herke, Christina M. Mynhardt

Discret. Math., 2009

Secure domination critical graphs.

Paul J. P. Grobler, Christina M. Mynhardt

Discret. Math., 2009

Claw-free graphs are not universal fixers.

Ernest J. Cockayne, Richard G. Gibson, Christina M. Mynhardt

Discret. Math., 2009

Edge protection in graphs.

William F. Klostermeyer, Christina M. Mynhardt

Australas. J Comb., 2009

2008

Secure domination and secure total domination in graphs.

William Klostermeyer, Christina M. Mynhardt

Discuss. Math. Graph Theory, 2008

Trees with depression three.

Christina M. Mynhardt

Discret. Math., 2008

Open irredundance and maximum degree in graphs.

Ernest J. Cockayne, Odile Favaron, Art S. Finbow, Christina M. Mynhardt

Discret. Math., 2008

Maximal Nontraceable Graphs with Toughness less than One.

Frank Bullock, Marietjie Frick, Joy Singleton, Susan A. van Aardt, Christina M. Mynhardt

Electron. J. Comb., 2008

Diameter of paired domination edge-critical graphs.

Michelle Edwards, Richard G. Gibson, Michael A. Henning, Christina M. Mynhardt

Australas. J Comb., 2008

Trees with domination subdivision number one.

Stephen Benecke, Christina M. Mynhardt

Australas. J Comb., 2008

2007

Couterexample to a conjecture on the structure of bipartite partionable graphs.

Richard G. Gibson, Christina M. Mynhardt

Discuss. Math. Graph Theory, 2007

2006

Construction of trees and graphs with equal domination parameters.

Michael Dorfling, Wayne Goddard, Michael A. Henning, Christina M. Mynhardt

Discret. Math., 2006

A lower bound for the depression of trees.

Ernest J. Cockayne, Christina M. Mynhardt

Australas. J Comb., 2006

2005

Altitude of regular graphs with girth at least five.

Christina M. Mynhardt, Alewyn P. Burger, T. C. Clark, B. Falvai, N. D. R. Henderson

Discret. Math., 2005

Altitude of small complete and complete bipartite graphs.

Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt

Australas. J Comb., 2005

2004

On the domination number of prisms of graphs.

Alewyn P. Burger, Christina M. Mynhardt, William D. Weakley

Discuss. Math. Graph Theory, 2004

On i^--ER-critical graphs.

Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt

Discret. Math., 2004

Total domination in Kr-covered graphs.

Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt

Ars Comb., 2004

2003

Upper bounds for the domination numbers of toroidal queens graphs.

Christina M. Mynhardt

Discuss. Math. Graph Theory, 2003

Vertices contained in all or in no minimum total dominating set of a tree.

Ernest J. Cockayne, Michael A. Henning, Christina M. Mynhardt

Discret. Math., 2003

Changing upper irredundance by edge addition.

Ernest J. Cockayne, Odile Favaron, Wayne Goddard, Paul J. P. Grobler, Christina M. Mynhardt

Discret. Math., 2003

An improved upper bound for queens domination numbers.

Alewyn P. Burger, Christina M. Mynhardt

Discret. Math., 2003

Total Domination Edge Critical Graphs with Minimum Diameter.

Lucas C. van der Merwe, Christina M. Mynhardt, Teresa W. Haynes

Ars Comb., 2003

The domination number of the toroidal queens graph of size 3k×3k.

Alewyn P. Burger, Christina M. Mynhardt, William D. Weakley

Australas. J Comb., 2003

2002

An upper bound for the minimum number of queens covering the n x n chessboard.

Alewyn P. Burger, Christina M. Mynhardt

Discret. Appl. Math., 2002

2001

Vertex criticality for upper domination and irredundance.

Paul J. P. Grobler, Christina M. Mynhardt

J. Graph Theory, 2001

Total Domination Edge Critical Graphs with Maximum Diameter.

Teresa W. Haynes, Christina M. Mynhardt, Lucas C. van der Merwe

Discuss. Math. Graph Theory, 2001

Domination parameters and edge-removal-critical graphs.

Paul J. P. Grobler, Christina M. Mynhardt

Discret. Math., 2001

Ramsey properties of generalised irredundant sets in graphs.

Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech

Discret. Math., 2001

Generalised Ramsey Numbers with respect to Classes of Graphs.

Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech

Ars Comb., 2001

Properties of Queens graphs and the irredundance number of Q₇.

Ernest J. Cockayne, Christina M. Mynhardt

Australas. J Comb., 2001

Queens graphs for chessboards on the torus.

Alewyn P. Burger, Christina M. Mynhardt, Ernest J. Cockayne

Australas. J Comb., 2001

2000

Total domination in graphs with minimum degree three.

Odile Favaron, Michael A. Henning, Christina M. Mynhardt, Joël Puech

J. Graph Theory, 2000

A characterization of (γ, <i>i</i>)-trees.

Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech

J. Graph Theory, 2000

On i-minus-Edge-Removal-critical graphs.

Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt

Electron. Notes Discret. Math., 2000

Nordhaus-Gaddum results for CO-irredundance in graphs.

Ernest J. Cockayne, Devon McCrea, Christina M. Mynhardt

Discret. Math., 2000

1999

Vertices contained in every minimum dominating set of a tree.

Christina M. Mynhardt

J. Graph Theory, 1999

On 1-dependent ramsey numbers for graphs.

Ernest J. Cockayne, Christina M. Mynhardt

Discuss. Math. Graph Theory, 1999

1998

An inequality chain of domination parameters for trees.

Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech

Discuss. Math. Graph Theory, 1998

Irredundant and perfect neighbourhood sets in trees.

Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt

Discret. Math., 1998

Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs.

Ernest J. Cockayne, Odile Favaron, Joël Puech, Christina M. Mynhardt

Australas. J Comb., 1998

1997

On equality in an upper bound for domination parameters of graphs.

Odile Favaron, Christina M. Mynhardt

J. Graph Theory, 1997

Domination and irredundance in cubic graphs.

Ernest J. Cockayne, Christina M. Mynhardt

Discret. Math., 1997

Domination and irredundance in the queens' graph.

Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt

Discret. Math., 1997

Irredundance and Maximum Degree in Graphs.

Ernest J. Cockayne, Christina M. Mynhardt

Comb. Probab. Comput., 1997

On Graphs With a Unique Least Common Multiple.

Gary Chartrand, Grzegorz Kubicki, Christina M. Mynhardt, Farrokh Saba

Ars Comb., 1997

1996

Domination critical graphs with higher independent domination numbers.

S. Ao, Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt

J. Graph Theory, 1996

Universal maximal packing functions of graphs.

Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt

Discret. Math., 1996

On the sizes of least common multiples of several pairs of graphs.

Odile Favaron, Christina M. Mynhardt

Ars Comb., 1996

On a generalization of signed dominating functions of graphs.

Ernest J. Cockayne, Christina M. Mynhardt

Ars Comb., 1996

1995

Total dominating functions in trees: Minimality and convexity.

Ernest J. Cockayne, Christina M. Mynhardt, Bo Yu

J. Graph Theory, 1995

A characterisation of universal minimal total dominating functions in trees.

Ernest J. Cockayne, Christina M. Mynhardt

Discret. Math., 1995

On a Nordhaus-Gaddum type problem for independent domination.

Ernest J. Cockayne, Gerd Fricke, Christina M. Mynhardt

Discret. Math., 1995

Properties of minimal dominating functions of graphs.

Ernest J. Cockayne, Gerd Fricke, Stephen T. Hedetniemi, Christina M. Mynhardt

Ars Comb., 1995

1994

Universal minimal total dominating functions in graphs.

Ernest J. Cockayne, Christina M. Mynhardt, Bo Yu

Networks, 1994

Convexity of minimal dominating functions of trees - II.

Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt

Discret. Math., 1994

1993

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

Ernest J. Cockayne, Christina M. Mynhardt

Discret. Math., 1993

1991

Lower Ramsey numbers for graphs.

Christina M. Mynhardt

Discret. Math., 1991

1990

On generalised minimal domination parameters for paths.

Béla Bollobás, Ernest J. Cockayne, Christina M. Mynhardt

Discret. Math., 1990

1989

Irredundant ramsey numbers for graphs.

Richard C. Brewster, Ernest J. Cockayne, Christina M. Mynhardt

J. Graph Theory, 1989

On the product of upper irredundance numbers of a graph and its complement.

Ernest J. Cockayne, Christina M. Mynhardt

Discret. Math., 1989

1985

Degree sets of degree uniform graphs.

Christina M. Mynhardt

Graphs Comb., 1985

1980

G-constructibility of planar graphs.

Christina M. Mynhardt, Izak Broere

J. Graph Theory, 1980

1979

Remarks on the critical graph conjecture.

Izak Broere, Christina M. Mynhardt

Discret. Math., 1979