default search action
Christina M. Mynhardt
Kieka Mynhardt
Person information
- affiliation: University of Victoria, BC, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j92]Elise Marchessault, Kieka Mynhardt
:
Lower boundary independent broadcasts in trees. Discuss. Math. Graph Theory 44(1): 75 (2024) - 2023
- [j91]MacKenzie Carr, Christina M. Mynhardt
Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs. Discuss. Math. Graph Theory 43(3): 859-874 (2023) - 2022
- [j90]Christina M. Mynhardt
Irredundance graphs. Discret. Appl. Math. 322: 36-48 (2022) - [j89]Christina M. Mynhardt
Irredundance trees of diameter 3. Discret. Math. 345(12): 113079 (2022) - [j88]Gary MacGillivray, Christina M. Mynhardt, Virgélot Virgile:
Eternal domination and clique covering. Electron. J. Graph Theory Appl. 10(2): 603-624 (2022) - 2021
- [j87]Christina M. Mynhardt
Block graphs with large paired domination multisubdivision number. Discuss. Math. Graph Theory 41(2): 665-684 (2021) - [i2]Gary MacGillivray, Christina M. Mynhardt, Virgélot Virgile:
Eternal Domination and Clique Covering. CoRR abs/2110.09732 (2021) - 2020
- [j86]Christina M. Mynhardt, S. E. A. Ogden:
Total Roman domination edge-supercritical and edge-removal-supercritical graphs. Australas. J Comb. 78: 413-433 (2020) - [j85]Christina M. Mynhardt
The k-conversion number of regular graphs. AKCE Int. J. Graphs Comb. 17(3): 955-965 (2020)
2010 – 2019
- 2019
- [j84]Saeid Alikhani, Davood Fatehi, Christina M. Mynhardt:
On k-total dominating graphs. Australas. J Comb. 73: 313-333 (2019) - [j83]M. D. Francis, Christina M. Mynhardt, Jane L. Wodlinger:
Subgraph-avoiding minimum decycling sets and k-conversion sets in graphs. Australas. J Comb. 74: 288-304 (2019) - [j82]Christina M. Mynhardt
Connected k-dominating graphs. Discret. Math. 342(1): 145-151 (2019) - 2018
- [i1]Christina M. Mynhardt, Jane L. Wodlinger:
The k-conversion number of regular graphs. CoRR abs/1812.03250 (2018) - 2017
- [j81]Christina M. Mynhardt
Dominating and irredundant broadcasts in graphs. Discret. Appl. Math. 220: 80-90 (2017) - 2016
- [j80]Christina M. Mynhardt
Triangle decompositions of planar graphs. Discuss. Math. Graph Theory 36(3): 643-659 (2016) - 2015
- [j79]S. Lunney, Christina M. Mynhardt:
More trees with equal broadcast and domination numbers. Australas. J Comb. 61: 251-272 (2015) - [j78]William F. Klostermeyer, Christina M. Mynhardt
Domination, eternal domination and clique covering. Discuss. Math. Graph Theory 35(2): 283-300 (2015) - 2014
- [j77]Christina M. Mynhardt, Mark Schurch:
A construction of a class of graphs with depression three. Australas. J Comb. 58: 249-263 (2014) - [j76]Bert L. Hartnell, Christina M. Mynhardt
Independent protection in graphs. Discret. Math. 335: 100-109 (2014) - [j75]Christina M. Mynhardt
The depression of a graph and k-kernels. Discuss. Math. Graph Theory 34(2): 233-247 (2014) - 2013
- [j74]Christina M. Mynhardt, Jane Wodlinger:
A class of trees with equal broadcast and domination numbers. Australas. J Comb. 56: 3-22 (2013) - [j73]Christina M. Mynhardt
A class of graphs with depression three. Discret. Math. 313(11): 1224-1232 (2013) - 2012
- [j72]William Klostermeyer, Christina M. Mynhardt:
Eternal Total Domination in Graphs. Ars Comb. 107: 473-492 (2012) - [j71]William Klostermeyer, Christina M. Mynhardt
Vertex covers and eternal dominating sets. Discret. Appl. Math. 160(7-8): 1183-1190 (2012) - [j70]Stephen Benecke, Christina M. Mynhardt
Characterizing Cartesian fixers and multipliers. Discuss. Math. Graph Theory 32(1): 161-175 (2012) - 2011
- [j69]Ernest J. Cockayne, Sarada Herke
Broadcasts and domination in trees. Discret. Math. 311(13): 1235-1246 (2011) - [j68]William Klostermeyer, Christina M. Mynhardt
Graphs with equal eternal vertex cover and eternal domination numbers. Discret. Math. 311(14): 1371-1379 (2011) - [j67]Christina M. Mynhardt
Paired domination in prisms of graphs. Discuss. Math. Graph Theory 31(1): 5-23 (2011) - 2010
- [j66]Alewyn P. Burger, Christina M. Mynhardt
Regular graphs are not universal fixers. Discret. Math. 310(2): 364-368 (2010) - [j65]Stephen Benecke, Christina M. Mynhardt
Domination of generalized Cartesian products. Discret. Math. 310(8): 1392-1397 (2010)
2000 – 2009
- 2009
- [j64]William F. Klostermeyer, Christina M. Mynhardt:
Edge protection in graphs. Australas. J Comb. 45: 235-250 (2009) - [j63]Ernest J. Cockayne, Richard G. Gibson, Christina M. Mynhardt
Claw-free graphs are not universal fixers. Discret. Math. 309(1): 128-133 (2009) - [j62]Paul J. P. Grobler, Christina M. Mynhardt
Secure domination critical graphs. Discret. Math. 309(19): 5820-5827 (2009) - [j61]Sarada Herke
Radial trees. Discret. Math. 309(20): 5950-5962 (2009) - 2008
- [j60]Michelle Edwards, Richard G. Gibson, Michael A. Henning, Christina M. Mynhardt:
Diameter of paired domination edge-critical graphs. Australas. J Comb. 40: 279-292 (2008) - [j59]Stephen Benecke, Christina M. Mynhardt:
Trees with domination subdivision number one. Australas. J Comb. 42: 201-210 (2008) - [j58]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) - [j57]Christina M. Mynhardt
Trees with depression three. Discret. Math. 308(5-6): 855-864 (2008) - [j56]Ernest J. Cockayne, Odile Favaron, Art S. Finbow, Christina M. Mynhardt
Open irredundance and maximum degree in graphs. Discret. Math. 308(23): 5358-5375 (2008) - [j55]William Klostermeyer, Christina M. Mynhardt
Secure domination and secure total domination in graphs. Discuss. Math. Graph Theory 28(2): 267-282 (2008) - 2007
- [j54]Richard G. Gibson, Christina M. Mynhardt
Couterexample to a conjecture on the structure of bipartite partionable graphs. Discuss. Math. Graph Theory 27(3): 527-540 (2007) - 2006
- [j53]Ernest J. Cockayne, Christina M. Mynhardt:
A lower bound for the depression of trees. Australas. J Comb. 35: 319-328 (2006) - [j52]Michael Dorfling, Wayne Goddard, Michael A. Henning, Christina M. Mynhardt
Construction of trees and graphs with equal domination parameters. Discret. Math. 306(21): 2647-2654 (2006) - 2005
- [j51]Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt:
Altitude of small complete and complete bipartite graphs. Australas. J Comb. 31: 167-178 (2005) - [j50]Christina M. Mynhardt
Altitude of regular graphs with girth at least five. Discret. Math. 294(3): 241-257 (2005) - 2004
- [j49]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt:
Total domination in Kr-covered graphs. Ars Comb. 71 (2004) - [j48]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
On i--ER-critical graphs. Discret. Math. 276(1-3): 111-125 (2004) - [j47]Alewyn P. Burger, Christina M. Mynhardt
On the domination number of prisms of graphs. Discuss. Math. Graph Theory 24(2): 303-318 (2004) - 2003
- [j46]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: 137-148 (2003) - [j45]Lucas C. van der Merwe, Christina M. Mynhardt, Teresa W. Haynes:
Total Domination Edge Critical Graphs with Minimum Diameter. Ars Comb. 66 (2003) - [j44]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): 37-44 (2003) - [j43]Alewyn P. Burger, Christina M. Mynhardt
An improved upper bound for queens domination numbers. Discret. Math. 266(1-3): 119-131 (2003) - [j42]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): 185-193 (2003) - [j41]Christina M. Mynhardt
Upper bounds for the domination numbers of toroidal queens graphs. Discuss. Math. Graph Theory 23(1): 163-175 (2003) - 2002
- [j40]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): 51-60 (2002) - 2001
- [j39]Ernest J. Cockayne, Christina M. Mynhardt:
Properties of Queens graphs and the irredundance number of Q7. Australas. J Comb. 23: 285-300 (2001) - [j38]Alewyn P. Burger, Christina M. Mynhardt, Ernest J. Cockayne:
Queens graphs for chessboards on the torus. Australas. J Comb. 24: 231-246 (2001) - [j37]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) - [j36]Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt
Ramsey properties of generalised irredundant sets in graphs. Discret. Math. 231(1-3): 123-134 (2001) - [j35]Paul J. P. Grobler, Christina M. Mynhardt
Domination parameters and edge-removal-critical graphs. Discret. Math. 231(1-3): 221-239 (2001) - [j34]Teresa W. Haynes, Christina M. Mynhardt
Total Domination Edge Critical Graphs with Maximum Diameter. Discuss. Math. Graph Theory 21(2): 187-205 (2001) - [j33]Paul J. P. Grobler, Christina M. Mynhardt
Vertex criticality for upper domination and irredundance. J. Graph Theory 37(4): 205-212 (2001) - 2000
- [j32]Ernest J. Cockayne, Devon McCrea, Christina M. Mynhardt
Nordhaus-Gaddum results for CO-irredundance in graphs. Discret. Math. 211: 209-215 (2000) - [j31]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
On i-minus-Edge-Removal-critical graphs. Electron. Notes Discret. Math. 5: 64-66 (2000) - [j30]Odile Favaron, Michael A. Henning, Christina M. Mynhardt, Joël Puech:
Total domination in graphs with minimum degree three. J. Graph Theory 34(1): 9-19 (2000) - [j29]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech:
A characterization of (γ, i)-trees. J. Graph Theory 34(4): 277-292 (2000)
1990 – 1999
- 1999
- [j28]Ernest J. Cockayne, Christina M. Mynhardt
On 1-dependent ramsey numbers for graphs. Discuss. Math. Graph Theory 19(1): 93-110 (1999) - [j27]Christina M. Mynhardt:
Vertices contained in every minimum dominating set of a tree. J. Graph Theory 31(3): 163-177 (1999) - 1998
- [j26]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: 253-262 (1998) - [j25]Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt
Irredundant and perfect neighbourhood sets in trees. Discret. Math. 188(1-3): 253-260 (1998) - [j24]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
An inequality chain of domination parameters for trees. Discuss. Math. Graph Theory 18(1): 127-142 (1998) - 1997
- [j23]Gary Chartrand, Grzegorz Kubicki, Christina M. Mynhardt, Farrokh Saba:
On Graphs With a Unique Least Common Multiple. Ars Comb. 46 (1997) - [j22]Ernest J. Cockayne, Christina M. Mynhardt:
Irredundance and Maximum Degree in Graphs. Comb. Probab. Comput. 6(2): 153-157 (1997) - [j21]Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt
Domination and irredundance in the queens' graph. Discret. Math. 163(1-3): 47-66 (1997) - [j20]Ernest J. Cockayne, Christina M. Mynhardt
Domination and irredundance in cubic graphs. Discret. Math. 167-168: 205-214 (1997) - [j19]Odile Favaron, Christina M. Mynhardt:
On equality in an upper bound for domination parameters of graphs. J. Graph Theory 24(3): 221-231 (1997) - 1996
- [j18]Ernest J. Cockayne, Christina M. Mynhardt:
On a generalization of signed dominating functions of graphs. Ars Comb. 43 (1996) - [j17]Odile Favaron, Christina M. Mynhardt:
On the sizes of least common multiples of several pairs of graphs. Ars Comb. 43 (1996) - [j16]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
Universal maximal packing functions of graphs. Discret. Math. 159(1-3): 57-68 (1996) - [j15]S. Ao, Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt:
Domination critical graphs with higher independent domination numbers. J. Graph Theory 22(1): 9-14 (1996) - 1995
- [j14]Ernest J. Cockayne, Gerd Fricke, Stephen T. Hedetniemi, Christina M. Mynhardt:
Properties of minimal dominating functions of graphs. Ars Comb. 41 (1995) - [j13]Ernest J. Cockayne, Gerd Fricke, Christina M. Mynhardt
On a Nordhaus-Gaddum type problem for independent domination. Discret. Math. 138(1-3): 199-205 (1995) - [j12]Ernest J. Cockayne, Christina M. Mynhardt
A characterisation of universal minimal total dominating functions in trees. Discret. Math. 141(1-3): 75-84 (1995) - [j11]Ernest J. Cockayne, Christina M. Mynhardt
Total dominating functions in trees: Minimality and convexity. J. Graph Theory 19(1): 83-92 (1995) - 1994
- [j10]Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt
Convexity of minimal dominating functions of trees - II. Discret. Math. 125(1-3): 137-146 (1994) - [j9]Ernest J. Cockayne, Christina M. Mynhardt
Universal minimal total dominating functions in graphs. Networks 24(2): 83-90 (1994) - 1993
- [j8]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): 89-102 (1993) - 1991
- [j7]Christina M. Mynhardt
Lower Ramsey numbers for graphs. Discret. Math. 91(1): 69-75 (1991) - 1990
- [j6]Béla Bollobás, Ernest J. Cockayne, Christina M. Mynhardt
On generalised minimal domination parameters for paths. Discret. Math. 86(1-3): 89-97 (1990)
1980 – 1989
- 1989
- [j5]Ernest J. Cockayne, Christina M. Mynhardt
On the product of upper irredundance numbers of a graph and its complement. Discret. Math. 76(2): 117-121 (1989) - [j4]Richard C. Brewster, Ernest J. Cockayne, Christina M. Mynhardt
Irredundant ramsey numbers for graphs. J. Graph Theory 13(3): 283-290 (1989) - 1985
- [j3]Christina M. Mynhardt
Degree sets of degree uniform graphs. Graphs Comb. 1(1): 283-290 (1985) - 1980
- [j2]Christina M. Mynhardt
G-constructibility of planar graphs. J. Graph Theory 4(3): 269-278 (1980)
1970 – 1979
- 1979
- [j1]Izak Broere, Christina M. Mynhardt
Remarks on the critical graph conjecture. Discret. Math. 26(3): 209-212 (1979)
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-07-20 20:31 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: