Christina M. Mynhardt

Publication Activity (10 Years)

Years Active: 1979-2023
Publications (10 Years): 14

Top Topics

Top Venues

Australas. J Comb.

Discuss. Math. Graph Theory

Publications

MacKenzie Carr, Christina M. Mynhardt, Ortrud R. Oellermann
Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs. Discuss. Math. Graph Theory 43 (3) (2023)
Christina M. Mynhardt, Adriana Roux
Irredundance trees of diameter 3. Discret. Math. 345 (12) (2022)
Gary MacGillivray, Christina M. Mynhardt, Virgélot Virgile
Eternal domination and clique covering. Electron. J. Graph Theory Appl. 10 (2) (2022)
Christina M. Mynhardt, Adriana Roux
Irredundance graphs. Discret. Appl. Math. 322 (2022)
Christina M. Mynhardt, Joanna Raczek
Block graphs with large paired domination multisubdivision number. Discuss. Math. Graph Theory 41 (2) (2021)
Gary MacGillivray, Christina M. Mynhardt, Virgélot Virgile
Eternal Domination and Clique Covering. CoRR (2021)
Christina M. Mynhardt, Jane L. Wodlinger
The k-conversion number of regular graphs. AKCE Int. J. Graphs Comb. 17 (3) (2020)
Christina M. Mynhardt, S. E. A. Ogden
Total Roman domination edge-supercritical and edge-removal-supercritical graphs. Australas. J Comb. 78 (2020)
M. D. Francis, Christina M. Mynhardt, Jane L. Wodlinger
Subgraph-avoiding minimum decycling sets and k-conversion sets in graphs. Australas. J Comb. 74 (2019)
Christina M. Mynhardt, L. E. Teshima, Adriana Roux
Connected k-dominating graphs. Discret. Math. 342 (1) (2019)
Saeid Alikhani, Davood Fatehi, Christina M. Mynhardt
On k-total dominating graphs. Australas. J Comb. 73 (2019)
Christina M. Mynhardt, Jane L. Wodlinger
The k-conversion number of regular graphs. CoRR (2018)
Christina M. Mynhardt, Adriana Roux
Dominating and irredundant broadcasts in graphs. Discret. Appl. Math. 220 (2017)
Christina M. Mynhardt, Christopher M. van Bommel
Triangle decompositions of planar graphs. Discuss. Math. Graph Theory 36 (3) (2016)
William F. Klostermeyer, Christina M. Mynhardt
Domination, eternal domination and clique covering. Discuss. Math. Graph Theory 35 (2) (2015)
S. Lunney, Christina M. Mynhardt
More trees with equal broadcast and domination numbers. Australas. J Comb. 61 (2015)
Christina M. Mynhardt, Mark Schurch
-kernels. Discuss. Math. Graph Theory 34 (2) (2014)
Christina M. Mynhardt, Mark Schurch
A construction of a class of graphs with depression three. Australas. J Comb. 58 (2014)
Bert L. Hartnell, Christina M. Mynhardt
Independent protection in graphs. Discret. Math. 335 (2014)
Christina M. Mynhardt, Jane Wodlinger
A class of trees with equal broadcast and domination numbers. Australas. J Comb. 56 (2013)
Christina M. Mynhardt, Mark Schurch
A class of graphs with depression three. Discret. Math. 313 (11) (2013)
S. Benecke, Christina M. Mynhardt
Characterizing Cartesian fixers and multipliers. Discuss. Math. Graph Theory 32 (1) (2012)
William Klostermeyer, Christina M. Mynhardt
Vertex covers and eternal dominating sets. Discret. Appl. Math. 160 (7-8) (2012)
William Klostermeyer, Christina M. Mynhardt
Eternal Total Domination in Graphs. Ars Comb. 107 (2012)
William Klostermeyer, Christina M. Mynhardt
Graphs with equal eternal vertex cover and eternal domination numbers. Discret. Math. 311 (14) (2011)
Christina M. Mynhardt, Mark Schurch
Paired domination in prisms of graphs. Discuss. Math. Graph Theory 31 (1) (2011)
Ernest J. Cockayne, Sarada Herke, Christina M. Mynhardt
Broadcasts and domination in trees. Discret. Math. 311 (13) (2011)
S. Benecke, Christina M. Mynhardt
Domination of generalized Cartesian products. Discret. Math. 310 (8) (2010)
Alewyn P. Burger, Christina M. Mynhardt
Regular graphs are not universal fixers. Discret. Math. 310 (2) (2010)
Sarada Herke, Christina M. Mynhardt
Radial trees. Discret. Math. 309 (20) (2009)
Paul J. P. Grobler, Christina M. Mynhardt
Secure domination critical graphs. Discret. Math. 309 (19) (2009)
William F. Klostermeyer, Christina M. Mynhardt
Edge protection in graphs. Australas. J Comb. 45 (2009)
Ernest J. Cockayne, Richard G. Gibson, Christina M. Mynhardt
Claw-free graphs are not universal fixers. Discret. Math. 309 (1) (2009)
Michelle Edwards, Richard G. Gibson, Michael A. Henning, Christina M. Mynhardt
Diameter of paired domination edge-critical graphs. Australas. J Comb. 40 (2008)
Frank Bullock, Marietjie Frick, Joy Singleton, Susan A. van Aardt, Christina M. Mynhardt
Maximal Nontraceable Graphs with Toughness less than One. Electron. J. Comb. 15 (1) (2008)
Christina M. Mynhardt
Trees with depression three. Discret. Math. 308 (5-6) (2008)
William Klostermeyer, Christina M. Mynhardt
Secure domination and secure total domination in graphs. Discuss. Math. Graph Theory 28 (2) (2008)
Ernest J. Cockayne, Odile Favaron, Art S. Finbow, Christina M. Mynhardt
Open irredundance and maximum degree in graphs. Discret. Math. 308 (23) (2008)
S. Benecke, Christina M. Mynhardt
Trees with domination subdivision number one. Australas. J Comb. 42 (2008)
Richard G. Gibson, Christina M. Mynhardt
Couterexample to a conjecture on the structure of bipartite partionable graphs. Discuss. Math. Graph Theory 27 (3) (2007)
Ernest J. Cockayne, Christina M. Mynhardt
A lower bound for the depression of trees. Australas. J Comb. 35 (2006)
Michael Dorfling, Wayne Goddard, Michael A. Henning, Christina M. Mynhardt
Construction of trees and graphs with equal domination parameters. Discret. Math. 306 (21) (2006)
Christina M. Mynhardt, Alewyn P. Burger, T. C. Clark, B. Falvai, N. D. R. Henderson
Altitude of regular graphs with girth at least five. Discret. Math. 294 (3) (2005)
Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt
Altitude of small complete and complete bipartite graphs. Australas. J Comb. 31 (2005)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
Total domination in Kr-covered graphs. Ars Comb. 71 (2004)
Alewyn P. Burger, Christina M. Mynhardt, William D. Weakley
On the domination number of prisms of graphs. Discuss. Math. Graph Theory 24 (2) (2004)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
-ER-critical graphs. Discret. Math. 276 (1-3) (2004)
Alewyn P. Burger, Christina M. Mynhardt
An improved upper bound for queens domination numbers. Discret. Math. 266 (1-3) (2003)
Christina M. Mynhardt
Upper bounds for the domination numbers of toroidal queens graphs. Discuss. Math. Graph Theory 23 (1) (2003)
Ernest J. Cockayne, Michael A. Henning, Christina M. Mynhardt
Vertices contained in all or in no minimum total dominating set of a tree. Discret. Math. 260 (1-3) (2003)
Ernest J. Cockayne, Odile Favaron, Wayne Goddard, Paul J. P. Grobler, Christina M. Mynhardt
Changing upper irredundance by edge addition. Discret. Math. 266 (1-3) (2003)
Lucas C. van der Merwe, Christina M. Mynhardt, Teresa W. Haynes
Total Domination Edge Critical Graphs with Minimum Diameter. Ars Comb. 66 (2003)
Alewyn P. Burger, Christina M. Mynhardt, William D. Weakley
The domination number of the toroidal queens graph of size 3k×3k. Australas. J Comb. 28 (2003)
Alewyn P. Burger, Christina M. Mynhardt
An upper bound for the minimum number of queens covering the n x n chessboard. Discret. Appl. Math. 121 (1-3) (2002)
Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech
Generalised Ramsey Numbers with respect to Classes of Graphs. Ars Comb. 59 (2001)
Teresa W. Haynes, Christina M. Mynhardt, Lucas C. van der Merwe
Total Domination Edge Critical Graphs with Maximum Diameter. Discuss. Math. Graph Theory 21 (2) (2001)
Paul J. P. Grobler, Christina M. Mynhardt
Domination parameters and edge-removal-critical graphs. Discret. Math. 231 (1-3) (2001)
Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech
Ramsey properties of generalised irredundant sets in graphs. Discret. Math. 231 (1-3) (2001)
Ernest J. Cockayne, Christina M. Mynhardt
. Australas. J Comb. 23 (2001)
Alewyn P. Burger, Christina M. Mynhardt, Ernest J. Cockayne
Queens graphs for chessboards on the torus. Australas. J Comb. 24 (2001)
Paul J. P. Grobler, Christina M. Mynhardt
Vertex criticality for upper domination and irredundance. J. Graph Theory 37 (4) (2001)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech
)-trees. J. Graph Theory 34 (4) (2000)
Odile Favaron, Michael A. Henning, Christina M. Mynhardt, Joël Puech
Total domination in graphs with minimum degree three. J. Graph Theory 34 (1) (2000)
Ernest J. Cockayne, Devon McCrea, Christina M. Mynhardt
Nordhaus-Gaddum results for CO-irredundance in graphs. Discret. Math. 211 (2000)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
On i-minus-Edge-Removal-critical graphs. Electron. Notes Discret. Math. 5 (2000)
Ernest J. Cockayne, Christina M. Mynhardt
On 1-dependent ramsey numbers for graphs. Discuss. Math. Graph Theory 19 (1) (1999)
Christina M. Mynhardt
Vertices contained in every minimum dominating set of a tree. J. Graph Theory 31 (3) (1999)
Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt
Irredundant and perfect neighbourhood sets in trees. Discret. Math. 188 (1-3) (1998)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech
An inequality chain of domination parameters for trees. Discuss. Math. Graph Theory 18 (1) (1998)
Ernest J. Cockayne, Odile Favaron, Joël Puech, Christina M. Mynhardt
Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs. Australas. J Comb. 18 (1998)
Gary Chartrand, Grzegorz Kubicki, Christina M. Mynhardt, Farrokh Saba
On Graphs With a Unique Least Common Multiple. Ars Comb. 46 (1997)
Ernest J. Cockayne, Christina M. Mynhardt
Domination and irredundance in cubic graphs. Discret. Math. (1997)
Ernest J. Cockayne, Christina M. Mynhardt
Irredundance and Maximum Degree in Graphs. Comb. Probab. Comput. 6 (2) (1997)
Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt
Domination and irredundance in the queens' graph. Discret. Math. 163 (1-3) (1997)
Odile Favaron, Christina M. Mynhardt
On equality in an upper bound for domination parameters of graphs. J. Graph Theory 24 (3) (1997)
Ernest J. Cockayne, Christina M. Mynhardt
On a generalization of signed dominating functions of graphs. Ars Comb. 43 (1996)
Odile Favaron, Christina M. Mynhardt
On the sizes of least common multiples of several pairs of graphs. Ars Comb. 43 (1996)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
Universal maximal packing functions of graphs. Discret. Math. 159 (1-3) (1996)
S. Ao, Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt
Domination critical graphs with higher independent domination numbers. J. Graph Theory 22 (1) (1996)
Ernest J. Cockayne, Gerd Fricke, Stephen T. Hedetniemi, Christina M. Mynhardt
Properties of minimal dominating functions of graphs. Ars Comb. 41 (1995)
Ernest J. Cockayne, Gerd Fricke, Christina M. Mynhardt
On a Nordhaus-Gaddum type problem for independent domination. Discret. Math. 138 (1-3) (1995)
Ernest J. Cockayne, Christina M. Mynhardt
A characterisation of universal minimal total dominating functions in trees. Discret. Math. 141 (1-3) (1995)
Ernest J. Cockayne, Christina M. Mynhardt, Bo Yu
Total dominating functions in trees: Minimality and convexity. J. Graph Theory 19 (1) (1995)
Ernest J. Cockayne, Christina M. Mynhardt, Bo Yu
Universal minimal total dominating functions in graphs. Networks 24 (2) (1994)
Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt
Convexity of minimal dominating functions of trees - II. Discret. Math. 125 (1-3) (1994)
Ernest J. Cockayne, Christina M. Mynhardt
The sequence of upper and lower domination, independence and irredundance numbers of a graph. Discret. Math. 122 (1-3) (1993)
Christina M. Mynhardt
Lower Ramsey numbers for graphs. Discret. Math. 91 (1) (1991)
Béla Bollobás, Ernest J. Cockayne, Christina M. Mynhardt
On generalised minimal domination parameters for paths. Discret. Math. 86 (1-3) (1990)
Ernest J. Cockayne, Christina M. Mynhardt
On the product of upper irredundance numbers of a graph and its complement. Discret. Math. 76 (2) (1989)
Richard C. Brewster, Ernest J. Cockayne, Christina M. Mynhardt
Irredundant ramsey numbers for graphs. J. Graph Theory 13 (3) (1989)
Christina M. Mynhardt
Degree sets of degree uniform graphs. Graphs Comb. 1 (1) (1985)
Christina M. Mynhardt, Izak Broere
G-constructibility of planar graphs. J. Graph Theory 4 (3) (1980)
Izak Broere, Christina M. Mynhardt
Remarks on the critical graph conjecture. Discret. Math. 26 (3) (1979)