The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christina M. Mynhardt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  29. Trees with depression three. [Citation Graph (, )][DBLP]


  30. Open irredundance and maximum degree in graphs. [Citation Graph (, )][DBLP]


  31. Claw-free graphs are not universal fixers. [Citation Graph (, )][DBLP]


  32. Radial trees. [Citation Graph (, )][DBLP]


  33. Secure domination critical graphs. [Citation Graph (, )][DBLP]


  34. Regular graphs are not universal fixers. [Citation Graph (, )][DBLP]


  35. Domination of generalized Cartesian products. [Citation Graph (, )][DBLP]


Search in 0.035secs, Finished in 0.036secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002