Christina M. Mynhardt

From MaRDI portal
Revision as of 00:04, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Christina M. Mynhardt to Christina M. Mynhardt: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:726642

Available identifiers

zbMath Open mynhardt.christina-mDBLP27/4833WikidataQ68246057 ScholiaQ68246057MaRDI QIDQ726642

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61211562024-02-26Paper
The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets2023-05-28Paper
Boundary and Hearing Independent Broadcasts in Graphs and Trees2023-05-04Paper
The $i$-Graphs of Paths and Cycles2023-03-14Paper
Reconfiguration of Minimum Independent Dominating Sets in Graphs2023-03-10Paper
Eternal domination and clique covering2022-11-29Paper
Eternal and Secure Domination in Graphs2021-12-15Paper
The k-conversion number of regular graphs2021-09-01Paper
Constructing Triangle Decomposable Multigraphs with Minimum Multi-edges2021-08-17Paper
Boundary Independent Broadcasts in Graphs2021-06-23Paper
Lower Boundary Independent Broadcasts in Trees2021-05-10Paper
Lower Bound and Exact Values for the Boundary Independence Broadcast Number of a Tree2021-05-05Paper
Comparing Upper Broadcast Domination and Boundary Independence Numbers of Graphs2021-04-05Paper
A Sharp Upper Bound for the Boundary Independence Broadcast Number of a Tree2021-04-05Paper
Block graphs with large paired domination multisubdivision number2021-02-10Paper
Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs2020-12-10Paper
A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$2020-11-23Paper
A dynamic domination problem in trees2020-11-16Paper
https://portal.mardi4nfdi.de/entity/Q51336512020-11-10Paper
Enumerating the Digitally Convex Sets of Powers of Cycles and Cartesian Products of Paths and Complete Graphs2020-08-06Paper
Reconfiguration of Colourings and Dominating Sets in Graphs: a Survey2020-03-12Paper
Total Roman domination edge-critical graphs2020-02-03Paper
https://portal.mardi4nfdi.de/entity/Q51975982019-09-19Paper
On k-Total Dominating Graphs2019-05-23Paper
A note on some variations of the $\gamma$-graph2018-06-14Paper
https://portal.mardi4nfdi.de/entity/Q46041102018-02-23Paper
Broadcasts in Graphs: Diametrical Trees2017-12-06Paper
Protecting a graph with mobile guards2017-07-19Paper
Integer solutions to \(x^2+ y^2= z^2-k\) for a fixed integer value \(k\)2017-06-14Paper
Triangle decompositions of planar graphs2016-07-13Paper
https://portal.mardi4nfdi.de/entity/Q28160692016-07-01Paper
https://portal.mardi4nfdi.de/entity/Q55003082015-08-05Paper
Domination, eternal domination, and clique covering2015-05-11Paper
On the \(\varepsilon\)-ascent chromatic index of complete graphs2015-04-16Paper
https://portal.mardi4nfdi.de/entity/Q52455452015-04-09Paper
Secure paired domination in graphs2015-02-16Paper
https://portal.mardi4nfdi.de/entity/Q28782062014-08-28Paper
Independent protection in graphs2014-08-21Paper
https://portal.mardi4nfdi.de/entity/Q28754952014-08-15Paper
The depression of a graph and \(k\)-kernels2014-05-16Paper
https://portal.mardi4nfdi.de/entity/Q28644752013-12-06Paper
A class of graphs with depression three2013-12-02Paper
https://portal.mardi4nfdi.de/entity/Q28608072013-11-11Paper
https://portal.mardi4nfdi.de/entity/Q28487162013-09-26Paper
New bounds for the broadcast domination number of a graph2013-06-14Paper
Characterizing Cartesian fixers and multipliers2012-09-05Paper
https://portal.mardi4nfdi.de/entity/Q28953532012-07-02Paper
Vertex covers and eternal dominating sets2012-05-30Paper
Paired domination in prisms of graphs2011-10-05Paper
Graphs with equal eternal vertex cover and eternal domination numbers2011-08-08Paper
https://portal.mardi4nfdi.de/entity/Q30038762011-05-31Paper
https://portal.mardi4nfdi.de/entity/Q30590082010-12-08Paper
Domination of generalized Cartesian products2010-04-27Paper
Regular graphs are not universal fixers2010-03-29Paper
Secure domination critical graphs2009-12-15Paper
https://portal.mardi4nfdi.de/entity/Q36261882009-05-22Paper
The diameter of paired-domination vertex critical graphs2009-05-06Paper
Maximal nontraceable graphs with toughness less than one2009-04-07Paper
Secure domination and secure total domination in graphs2009-02-26Paper
Open irredundance and maximum degree in graphs2009-01-28Paper
Claw-free graphs are not universal fixers2009-01-28Paper
https://portal.mardi4nfdi.de/entity/Q55033362009-01-15Paper
https://portal.mardi4nfdi.de/entity/Q55033572009-01-15Paper
https://portal.mardi4nfdi.de/entity/Q35342832008-11-03Paper
Couterexample to a conjecture on the structure of bipartite partionable graphs2008-06-18Paper
Trees with depression three2008-02-14Paper
Construction of trees and graphs with equal domination parameters2006-10-30Paper
https://portal.mardi4nfdi.de/entity/Q54883402006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54807262006-08-03Paper
https://portal.mardi4nfdi.de/entity/Q54660502005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q54634732005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54616832005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54617052005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54609002005-07-20Paper
Altitude of regular graphs with girth at least five2005-06-10Paper
https://portal.mardi4nfdi.de/entity/Q46819922005-06-09Paper
Altitude of 4-regular circulants2005-05-03Paper
On the domination number of prisms of graphs2005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q46595942005-03-21Paper
https://portal.mardi4nfdi.de/entity/Q48261832004-11-11Paper
https://portal.mardi4nfdi.de/entity/Q48262802004-11-11Paper
https://portal.mardi4nfdi.de/entity/Q48208382004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48129252004-08-23Paper
Upper bounds for the domination numbers of toroidal queens graphs2004-03-25Paper
On \(i^{-}\)-ER-critical graphs2004-02-14Paper
https://portal.mardi4nfdi.de/entity/Q44329372004-02-10Paper
An improved upper bound for queens domination numbers2003-06-09Paper
Changing upper irredundance by edge addition2003-06-09Paper
https://portal.mardi4nfdi.de/entity/Q47985322003-05-20Paper
Total Domination Edge Critical Graphs with Maximum Diameter2003-03-18Paper
https://portal.mardi4nfdi.de/entity/Q27704472003-03-18Paper
Vertices contained in all or in no minimum total dominating set of a tree2003-03-16Paper
An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard2002-08-29Paper
Ramsey properties of generalised irredundant sets in graphs2002-01-08Paper
https://portal.mardi4nfdi.de/entity/Q27604452002-01-02Paper
Domination parameters and edge-removal-critical graphs2001-11-28Paper
Vertex criticality for upper domination and irredundance2001-10-10Paper
https://portal.mardi4nfdi.de/entity/Q45048852001-10-02Paper
https://portal.mardi4nfdi.de/entity/Q27125292001-08-12Paper
https://portal.mardi4nfdi.de/entity/Q45031112001-02-12Paper
https://portal.mardi4nfdi.de/entity/Q45006102001-01-29Paper
https://portal.mardi4nfdi.de/entity/Q49435312000-12-03Paper
https://portal.mardi4nfdi.de/entity/Q45060682000-11-29Paper
Irredundant and perfect neighbourhood sets in trees2000-11-02Paper
https://portal.mardi4nfdi.de/entity/Q44892432000-09-25Paper
https://portal.mardi4nfdi.de/entity/Q44870712000-09-04Paper
Nordhaus-Gaddum results for CO-irredundance in graphs2000-07-27Paper
https://portal.mardi4nfdi.de/entity/Q44891872000-07-09Paper
https://portal.mardi4nfdi.de/entity/Q49435172000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q49400502000-03-01Paper
Vertices contained in every minimum dominating set of a tree2000-02-16Paper
https://portal.mardi4nfdi.de/entity/Q49339352000-01-17Paper
https://portal.mardi4nfdi.de/entity/Q45048882000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q45049022000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q48745851999-09-29Paper
On 1-dependent ramsey numbers for graphs1999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42282291999-08-19Paper
https://portal.mardi4nfdi.de/entity/Q42220901999-07-19Paper
An inequality chain of domination parameters for trees1999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q43786361999-02-11Paper
https://portal.mardi4nfdi.de/entity/Q43786261998-04-28Paper
https://portal.mardi4nfdi.de/entity/Q43677851998-02-22Paper
https://portal.mardi4nfdi.de/entity/Q43747061998-01-25Paper
https://portal.mardi4nfdi.de/entity/Q43747141998-01-25Paper
Domination and irredundance in cubic graphs1997-10-29Paper
https://portal.mardi4nfdi.de/entity/Q43615681997-10-28Paper
Domination and irredundance in the queens' graph1997-10-26Paper
On equality in an upper bound for domination parameters of graphs1997-10-07Paper
Irredundance and Maximum Degree in Graphs1997-08-07Paper
Universal maximal packing functions of graphs1996-12-08Paper
EXTREMUM AGGREGATES OF MINIMAL 0-DOMINATING FUNCTIONS OF GRAPHS1996-07-31Paper
https://portal.mardi4nfdi.de/entity/Q48879421996-07-23Paper
https://portal.mardi4nfdi.de/entity/Q48791601996-07-08Paper
https://portal.mardi4nfdi.de/entity/Q48651381996-06-27Paper
https://portal.mardi4nfdi.de/entity/Q48622161996-06-18Paper
https://portal.mardi4nfdi.de/entity/Q48737651996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48736931996-04-17Paper
https://portal.mardi4nfdi.de/entity/Q48537521995-11-01Paper
https://portal.mardi4nfdi.de/entity/Q46976111995-10-05Paper
https://portal.mardi4nfdi.de/entity/Q46976161995-10-05Paper
A characterisation of universal minimal total dominating functions in trees1995-07-24Paper
On a Nordhaus-Gaddum type problem for independent domination1995-04-17Paper
The irredundant ramsey number s(3,3,3) = 131995-02-28Paper
Total dominating functions in trees: Minimality and convexity1995-02-01Paper
Universal minimal total dominating functions in graphs1995-01-19Paper
https://portal.mardi4nfdi.de/entity/Q43091111994-12-05Paper
Convexity of minimal dominating functions of trees. II1994-08-07Paper
CONVEXITY OF MINIMAL DOMINATING FUNCTIONS OF TREES: A SURVEY1994-04-21Paper
The sequence of upper and lower domination, independence and irredundance numbers of a graph1994-03-10Paper
https://portal.mardi4nfdi.de/entity/Q40273331993-02-21Paper
https://portal.mardi4nfdi.de/entity/Q40143121992-10-06Paper
https://portal.mardi4nfdi.de/entity/Q39870401992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39870511992-06-28Paper
Lower Ramsey numbers for graphs1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39805541992-06-26Paper
Atom probe tomography characterization of solute segregation to dislocations and interfaces1992-06-25Paper
On generalised minimal domination parameters for paths1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39746901992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q33513931991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31994501990-01-01Paper
THE IRREDUNDANT RAMSEY NUMBER s(3,6)1990-01-01Paper
On the product of upper irredundance numbers of a graph and its complement1989-01-01Paper
Irredundant ramsey numbers for graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34900401989-01-01Paper
Irredundant ramsey numbers for graphs1989-01-01Paper
GENERALISED MAXIMAL INDEPENDENCE AND CLIQUE NUMBERS OF GRAPHS1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38191041987-01-01Paper
Degree sets of degree uniform graphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36884071985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36892061985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39537861981-01-01Paper
-constructibility of planar graphs1980-01-01Paper
-constructibility of planar graphs1980-01-01Paper
Remarks on the critical graph conjecture1979-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Christina M. Mynhardt