| 2009 |
|---|
| 32 | EE | Ernest J. Cockayne,
R. G. Gibson,
Christina M. Mynhardt:
Claw-free graphs are not universal fixers.
Discrete Mathematics 309(1): 128-133 (2009) |
| 2008 |
|---|
| 31 | EE | Ernest J. Cockayne,
Odile Favaron,
S. Finbow,
Christina M. Mynhardt:
Open irredundance and maximum degree in graphs.
Discrete Mathematics 308(23): 5358-5375 (2008) |
| 30 | EE | Christina M. Mynhardt:
Trees with depression three.
Discrete Mathematics 308(5-6): 855-864 (2008) |
| 2006 |
|---|
| 29 | EE | Michael Dorfling,
Wayne Goddard,
Michael A. Henning,
Christina M. Mynhardt:
Construction of trees and graphs with equal domination parameters.
Discrete Mathematics 306(21): 2647-2654 (2006) |
| 2005 |
|---|
| 28 | EE | Christina M. Mynhardt,
Alewyn P. Burger,
T. C. Clark,
B. Falvai,
N. D. R. Henderson:
Altitude of regular graphs with girth at least five.
Discrete Mathematics 294(3): 241-257 (2005) |
| 2004 |
|---|
| 27 | | Ernest J. Cockayne,
Odile Favaron,
Christina M. Mynhardt:
Total domination in Kr-covered graphs.
Ars Comb. 71: (2004) |
| 26 | EE | Ernest J. Cockayne,
Odile Favaron,
Christina M. Mynhardt:
On i--ER-critical graphs.
Discrete Mathematics 276(1-3): 111-125 (2004) |
| 2003 |
|---|
| 25 | | Lucas C. van der Merwe,
Christina M. Mynhardt,
Teresa W. Haynes:
Total Domination Edge Critical Graphs with Minimum Diameter.
Ars Comb. 66: (2003) |
| 24 | EE | Ernest J. Cockayne,
Michael A. Henning,
Christina M. Mynhardt:
Vertices contained in all or in no minimum total dominating set of a tree.
Discrete Mathematics 260(1-3): 37-44 (2003) |
| 23 | EE | Alewyn P. Burger,
Christina M. Mynhardt:
An improved upper bound for queens domination numbers.
Discrete Mathematics 266(1-3): 119-131 (2003) |
| 22 | EE | Ernest J. Cockayne,
Odile Favaron,
Wayne Goddard,
Paul J. P. Grobler,
Christina M. Mynhardt:
Changing upper irredundance by edge addition.
Discrete Mathematics 266(1-3): 185-193 (2003) |
| 2002 |
|---|
| 21 | | Alewyn P. Burger,
Christina M. Mynhardt:
An upper bound for the minimum number of queens covering the n x n chessboard.
Discrete Applied Mathematics 121(1-3): 51-60 (2002) |
| 2001 |
|---|
| 20 | | 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) |
| 19 | EE | Ernest J. Cockayne,
Odile Favaron,
Paul J. P. Grobler,
Christina M. Mynhardt,
Joël Puech:
Ramsey properties of generalised irredundant sets in graphs.
Discrete Mathematics 231(1-3): 123-134 (2001) |
| 18 | EE | Paul J. P. Grobler,
Christina M. Mynhardt:
Domination parameters and edge-removal-critical graphs.
Discrete Mathematics 231(1-3): 221-239 (2001) |
| 2000 |
|---|
| 17 | EE | Ernest J. Cockayne,
Devon McCrea,
Christina M. Mynhardt:
Nordhaus-Gaddum results for CO-irredundance in graphs.
Discrete Mathematics 211: 209-215 (2000) |
| 16 | EE | Ernest J. Cockayne,
Odile Favaron,
Christina M. Mynhardt:
On i-minus-Edge-Removal-critical graphs.
Electronic Notes in Discrete Mathematics 5: 64-66 (2000) |
| 1998 |
|---|
| 15 | EE | Ernest J. Cockayne,
Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi,
Christina M. Mynhardt:
Irredundant and perfect neighbourhood sets in trees.
Discrete Mathematics 188(1-3): 253-260 (1998) |
| 1997 |
|---|
| 14 | | Gary Chartrand,
Grzegorz Kubicki,
Christina M. Mynhardt,
Farrokh Saba:
On Graphs With a Unique Least Common Multiple.
Ars Comb. 46: (1997) |
| 13 | | Ernest J. Cockayne,
Christina M. Mynhardt:
Irredundance and Maximum Degree in Graphs.
Combinatorics, Probability & Computing 6(2): 153-157 (1997) |
| 12 | EE | Alewyn P. Burger,
Ernest J. Cockayne,
Christina M. Mynhardt:
Domination and irredundance in the queens' graph.
Discrete Mathematics 163(1-3): 47-66 (1997) |
| 11 | EE | Ernest J. Cockayne,
Christina M. Mynhardt:
Domination and irredundance in cubic graphs.
Discrete Mathematics 167-168: 205-214 (1997) |
| 1996 |
|---|
| 10 | | Ernest J. Cockayne,
Christina M. Mynhardt:
On a generalization of signed dominating functions of graphs.
Ars Comb. 43: (1996) |
| 9 | | Odile Favaron,
Christina M. Mynhardt:
On the sizes of least common multiples of several pairs of graphs.
Ars Comb. 43: (1996) |
| 8 | EE | Ernest J. Cockayne,
Odile Favaron,
Christina M. Mynhardt:
Universal maximal packing functions of graphs.
Discrete Mathematics 159(1-3): 57-68 (1996) |
| 1995 |
|---|
| 7 | EE | Ernest J. Cockayne,
Gerd Fricke,
Christina M. Mynhardt:
On a Nordhaus-Gaddum type problem for independent domination.
Discrete Mathematics 138(1-3): 199-205 (1995) |
| 6 | EE | Ernest J. Cockayne,
Christina M. Mynhardt:
A characterisation of universal minimal total dominating functions in trees.
Discrete Mathematics 141(1-3): 75-84 (1995) |
| 1994 |
|---|
| 5 | EE | Ernest J. Cockayne,
Gary MacGillivray,
Christina M. Mynhardt:
Convexity of minimal dominating functions of trees - II.
Discrete Mathematics 125(1-3): 137-146 (1994) |
| 1993 |
|---|
| 4 | EE | Ernest J. Cockayne,
Christina M. Mynhardt:
The sequence of upper and lower domination, independence and irredundance numbers of a graph.
Discrete Mathematics 122(1-3): 89-102 (1993) |
| 1991 |
|---|
| 3 | EE | Christina M. Mynhardt:
Lower Ramsey numbers for graphs.
Discrete Mathematics 91(1): 69-75 (1991) |
| 1990 |
|---|
| 2 | EE | Béla Bollobás,
Ernest J. Cockayne,
Christina M. Mynhardt:
On generalised minimal domination parameters for paths.
Discrete Mathematics 86(1-3): 89-97 (1990) |
| 1989 |
|---|
| 1 | EE | Ernest J. Cockayne,
Christina M. Mynhardt:
On the product of upper irredundance numbers of a graph and its complement.
Discrete Mathematics 76(2): 117-121 (1989) |
