The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael A. Henning: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sheng Bau, Michael A. Henning, Peter Dankelmann
    Average lower independence in trees and outerplanar graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:69, n:, pp:- [Journal]
  2. Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang
    Detour Domination in Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:71, n:, pp:- [Journal]
  3. David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart
    Multipartite Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  4. Michael Dorfling, Wayne Goddard, Michael A. Henning
    Domination in Planar Graphs with Small Diameter II. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2006, v:78, n:, pp:- [Journal]
  5. John G. Gimbel, Michael A. Henning, Zsolt Tuza
    Switching Distance Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:47, n:, pp:- [Journal]
  6. Johannes H. Hattingh, Michael A. Henning, Jacobus L. Walters
    Distance irredundance in graphs: complexity issues. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:50, n:, pp:- [Journal]
  7. Johannes H. Hattingh, Elna Ungerer, Michael A. Henning
    Partial signed domination in graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:48, n:, pp:- [Journal]
  8. Teresa W. Haynes, Michael A. Henning
    The domatic numbers of factors of graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:56, n:, pp:- [Journal]
  9. Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley
    Stable and unstable graphs with total irredundance number zero. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:61, n:, pp:- [Journal]
  10. Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe
    Domination and total domination critical trees with respect to relative complements. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:59, n:, pp:- [Journal]
  11. Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe
    Total domination critical graphs with respect to relative complements. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:64, n:, pp:169-0 [Journal]
  12. Teresa W. Haynes, Michael A. Henning, Peter J. Slater
    Trees with Equal Domination and Paired-domination Numbers. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:76, n:, pp:- [Journal]
  13. Michael A. Henning
    Trees with equal average domination and independent domination numbers. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:71, n:, pp:- [Journal]
  14. Michael A. Henning
    Domination in regular graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:43, n:, pp:- [Journal]
  15. Michael A. Henning, Ortrud Oellermann
    Metric-Locating-Dominating Sets in Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:73, n:, pp:- [Journal]
  16. Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning
    Global Defensive Alliances in Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  17. Michael Dorfling, Michael A. Henning
    A note on power domination in grid graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:6, pp:1023-1027 [Journal]
  18. Jean E. Dunbar, Wayne Goddard, Stephen T. Hedetniemi, Alice A. McRae, Michael A. Henning
    The Algorithmic Complexity of Minus Domination in Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:68, n:1-2, pp:73-84 [Journal]
  19. Gerd Fricke, Michael A. Henning, Ortrud Oellermann, Henda C. Swart
    An Algorithm to Find Two Distance Domination Parameters in a Graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:68, n:1-2, pp:85-91 [Journal]
  20. Teresa W. Haynes, Michael A. Henning, Jamie Howard
    Locating and total dominating sets in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:8, pp:1293-1300 [Journal]
  21. Michael A. Henning, Hiren Maharaj
    Some General Aspects of the Framing Number of a Digraph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:115-133 [Journal]
  22. Michael A. Henning, Ortrud Oellermann
    The average connectivity of a digraph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:140, n:1-3, pp:143-153 [Journal]
  23. Sheng Bau, Michael A. Henning
    Matching transformation graphs of cubic bipartite plane graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:27-36 [Journal]
  24. Robert C. Brigham, Teresa W. Haynes, Michael A. Henning, Douglas F. Rall
    Bicritical domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:305, n:1-3, pp:18-32 [Journal]
  25. Gary Chartrand, David Erwin, Michael A. Henning, Peter J. Slater, Ping Zhang
    Graphs of order n with locating-chromatic number n-1. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:65-79 [Journal]
  26. Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang
    Stratification and domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:272, n:2-3, pp:171-185 [Journal]
  27. 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]
  28. Gayla S. Domke, Johannes H. Hattingh, Michael A. Henning, Lisa R. Markus
    Restrained domination in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:1-9 [Journal]
  29. Michael A. Dorfling, Wayne Goddard, Johannes H. Hattingh, Michael A. Henning
    Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:300, n:1-3, pp:82-90 [Journal]
  30. Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley
    Total irredundance in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:115-127 [Journal]
  31. Odile Favaron, Michael A. Henning, Joël Puech, Dieter Rautenbach
    On domination and annihilation in graphs with claw-free blocks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:143-151 [Journal]
  32. Wayne Goddard, Michael A. Henning
    Pancyclicity of the prism. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:139-142 [Journal]
  33. Wayne Goddard, Michael A. Henning
    Nordhaus-Gaddum bounds for independent domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:299-302 [Journal]
  34. Wayne Goddard, Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe
    The diameter of total domination vertex critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:3, pp:255-261 [Journal]
  35. Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann
    Bipartite Ramsey numbers and Zarankiewicz numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:85-95 [Journal]
  36. Teresa W. Haynes, Michael A. Henning
    A characterization of i-excellent trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:248, n:1-3, pp:69-77 [Journal]
  37. Teresa W. Haynes, Michael A. Henning
    Trees with equal domination and tree-free domination numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:242, n:1-3, pp:93-102 [Journal]
  38. Teresa W. Haynes, Michael A. Henning
    Changing and unchanging domination: a classification. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:272, n:1, pp:65-79 [Journal]
  39. Teresa W. Haynes, Michael A. Henning
    Trees with two disjoint minimum independent dominating sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:304, n:1-3, pp:69-78 [Journal]
  40. Teresa W. Haynes, Michael A. Henning, Lora Hopkins
    Total domination subdivision numbers of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:3, pp:195-202 [Journal]
  41. Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Peter J. Slater
    H-forming sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:159-169 [Journal]
  42. Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe
    Total domination supercritical graphs with respect to relative complements. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:258, n:1-3, pp:361-371 [Journal]
  43. Teresa W. Haynes, Michael A. Henning, Peter J. Slater
    Strong equality of domination parameters in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:260, n:1-3, pp:77-87 [Journal]
  44. Michael A. Henning
    Graphs with least domination number three-fifths their order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:216, n:1-3, pp:153-168 [Journal]
  45. Michael A. Henning
    Restricted domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:175-189 [Journal]
  46. Michael A. Henning
    Signed 2-independence in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:250, n:1-3, pp:93-107 [Journal]
  47. Michael A. Henning
    Defending the Roman Empire from multiple attacks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:101-115 [Journal]
  48. Michael A. Henning
    Total domination excellent trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:93-104 [Journal]
  49. Michael A. Henning
    Restricted total domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:289, n:1-3, pp:25-44 [Journal]
  50. Michael A. Henning
    Signed total domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:278, n:1-3, pp:109-125 [Journal]
  51. Michael A. Henning, Stephen T. Hedetniemi
    Defending the Roman Empire--A new strategy. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:239-251 [Journal]
  52. Michael A. Henning, Jacob Elgin Maritz
    Stratification and domination in graphs II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:3, pp:203-211 [Journal]
  53. Michael A. Henning, Jacob Elgin Maritz
    Stratification and domination in graphs with minimum degree two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:301, n:2-3, pp:175-194 [Journal]
  54. Michael A. Henning, Ortrud Oellermann
    The upper domination Ramsey number u(3, 3, 3). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:242, n:1-3, pp:103-113 [Journal]
  55. Michael A. Henning, Ortrud Oellermann
    On upper domination Ramsey numbers for graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:274, n:1-3, pp:125-135 [Journal]
  56. Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu Laskar
    Simultaneous graph parameters: Factor domination and factor total domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:18, pp:2229-2233 [Journal]
  57. 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]
  58. Michael A. Henning, Preben D. Vestergaard
    Domination in partitioned graphs with minimum degree two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1115-1135 [Journal]
  59. Michael A. Henning
    Restricted domination in graphs with minimum degree 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1356-1366 [Journal]
  60. Michael A. Henning, Dieter Rautenbach
    On the irregularity of bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1467-1472 [Journal]
  61. Gary Chartrand, Wayne Goddard, Michael A. Henning, Farrokh Saba, Henda C. Swart
    Principal Common Divisors of Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:2, pp:85-93 [Journal]
  62. Odile Favaron, Michael A. Henning
    Paired-Domination in Claw-Free Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:447-456 [Journal]
  63. Michael A. Henning, Douglas F. Rall
    On the Total Domination Number of Cartesian Products of Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:1, pp:63-69 [Journal]
  64. Michael A. Henning
    Graphs with large paired-domination number. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:13, n:1, pp:61-78 [Journal]
  65. Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart
    Generalized eccentricity, radius, and diameter in graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:4, pp:312-319 [Journal]
  66. Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning
    Domination in Graphs Applied to Electric Power Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:4, pp:519-529 [Journal]
  67. Wayne Goddard, Michael A. Henning
    Multiple vertex coverings by cliques. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:2, pp:157-167 [Journal]
  68. Michael A. Henning
    A linear Vizing-like relation relating the size and total domination number of a graph. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:4, pp:285-290 [Journal]
  69. Erfang Shan, Liying Kang, Michael A. Henning
    Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph". [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:4, pp:350-353 [Journal]
  70. Lowell W. Beineke, Izak Broere, Michael A. Henning
    Queens graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:206, n:1-3, pp:63-75 [Journal]
  71. Michael A. Henning
    Graphs with large restrained domination number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:415-429 [Journal]
  72. Gerd Fricke, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning
    On perfect neighborhood sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:221-225 [Journal]
  73. Wayne Goddard, Michael A. Henning
    Real and integer domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:61-75 [Journal]
  74. Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae
    Minus domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:35-47 [Journal]
  75. Johannes H. Hattingh, Michael A. Henning
    Star-path bipartite Ramsey numbers, . [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:185, n:1-3, pp:255-258 [Journal]
  76. Michael A. Henning
    Packing in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:186, n:1-3, pp:145-155 [Journal]
  77. Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart
    Local edge domination critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:161, n:1-3, pp:175-184 [Journal]
  78. Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart
    The diversity of domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:161, n:1-3, pp:161-173 [Journal]
  79. Lowell W. Beineke, Michael A. Henning
    Opinion functions on trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:167, n:, pp:127-139 [Journal]
  80. Michael A. Henning, Henda C. Swart
    Bounds relating generalized domination parameters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:93-105 [Journal]
  81. Michael A. Henning
    Irredundance perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:107-120 [Journal]
  82. Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae
    Minus domination in regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:311-312 [Journal]
  83. Michael A. Henning, Peter J. Slater
    Inequalities relating domination parameters in cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:158, n:1-3, pp:87-98 [Journal]
  84. Izak Broere, Johannes H. Hattingh, Michael A. Henning, Alice A. McRae
    Majority domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:125-135 [Journal]
  85. Marietjie Frick, Michael A. Henning
    Extremal results on defective colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:126, n:1-3, pp:151-158 [Journal]
  86. Wayne Goddard, Michael A. Henning
    Restricted domination parameters in graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:13, n:4, pp:353-363 [Journal]
  87. Paul Dorbec, Sylvain Gravier, Michael A. Henning
    Paired-domination in generalized claw-free graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:1, pp:1-7 [Journal]

  88. An independent dominating set in the complement of a minimum dominating set of a tree. [Citation Graph (, )][DBLP]


  89. A note on graphs with disjoint dominating and total dominating sets. [Citation Graph (, )][DBLP]


  90. On the signed total chromatic number of a graph. [Citation Graph (, )][DBLP]


  91. Placing monitoring devices in electric power networks modelled by block graphs. [Citation Graph (, )][DBLP]


  92. Restrained Domination Excellent Trees. [Citation Graph (, )][DBLP]


  93. Private Domination Trees. [Citation Graph (, )][DBLP]


  94. Stratification and Domination in Prisms. [Citation Graph (, )][DBLP]


  95. Total Domination and Matching Numbers in Claw-Free Graphs. [Citation Graph (, )][DBLP]


  96. A New Upper Bound on the Total Domination Number of a Graph. [Citation Graph (, )][DBLP]


  97. Bounds relating the weakly connected domination number to the total domination number and the matching number. [Citation Graph (, )][DBLP]


  98. On total domination vertex critical graphs of high connectivity. [Citation Graph (, )][DBLP]


  99. Domination, radius, and minimum degree. [Citation Graph (, )][DBLP]


  100. Locating and paired-dominating sets in graphs. [Citation Graph (, )][DBLP]


  101. Properties of total domination edge-critical graphs. [Citation Graph (, )][DBLP]


  102. k-tuple total domination in graphs. [Citation Graph (, )][DBLP]


  103. Disjoint dominating and total dominating sets in graphs. [Citation Graph (, )][DBLP]


  104. Total domination critical and stable graphs upon edge removal. [Citation Graph (, )][DBLP]


  105. On equality in an upper bound for the restrained and total domination numbers of a graph. [Citation Graph (, )][DBLP]


  106. Total restrained domination in graphs with minimum degree two. [Citation Graph (, )][DBLP]


  107. The independence number in graphs of maximum degree three. [Citation Graph (, )][DBLP]


  108. Bounds on total domination in claw-free cubic graphs. [Citation Graph (, )][DBLP]


  109. On matching and total domination in graphs. [Citation Graph (, )][DBLP]


  110. Total domination in claw-free graphs with minimum degree 2. [Citation Graph (, )][DBLP]


  111. A survey of selected recent results on total domination in graphs. [Citation Graph (, )][DBLP]


  112. On the ratios between packing and domination parameters of a graph. [Citation Graph (, )][DBLP]


  113. Total domination in planar graphs of diameter two. [Citation Graph (, )][DBLP]


  114. Remarks about disjoint dominating sets. [Citation Graph (, )][DBLP]


  115. A survey of stratified domination in graphs. [Citation Graph (, )][DBLP]


  116. An upper bound on the domination number of a graph with minimum degree 2. [Citation Graph (, )][DBLP]


  117. A dedication to Professor Gary Chartrand. [Citation Graph (, )][DBLP]


  118. Erratum to: "Local edge domination critical graphs" [Discrete Mathematics 161 (1996) 175-184]. [Citation Graph (, )][DBLP]


  119. On a conjecture on total domination in claw-free cubic graphs. [Citation Graph (, )][DBLP]


  120. An upper bound on the paired-domination number in terms of the number of edges in the graph. [Citation Graph (, )][DBLP]


  121. Local Steiner convexity. [Citation Graph (, )][DBLP]


Search in 0.031secs, Finished in 0.034secs
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