The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bert Hartnell: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bert Hartnell
    On Determining the 2-Packing and Domination Numbers of the Cartesian Product of Certain Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:55, n:, pp:- [Journal]
  2. Bert Hartnell
    On The Local Structure Of Well-Covered Graphs Without 4-Cycles. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:45, n:, pp:- [Journal]
  3. Bert Hartnell, Preben D. Vestergaard
    Dominating sets with at most k components. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:74, n:, pp:- [Journal]
  4. Bert Hartnell, Carol Whitehead
    On k-packings of graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:47, n:, pp:- [Journal]
  5. Art S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer
    On well-covered triangulations: Part I. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:97-108 [Journal]
  6. Georg Gunther, Bert Hartnell, Douglas F. Rall
    Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of Deletion. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:46, n:2, pp:167-172 [Journal]
  7. Bert Hartnell, Michael D. Plummer
    On 4-connected Claw-free Well-covered Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:64, n:1, pp:57-65 [Journal]
  8. Rommel Barbosa, Bert Hartnell
    Characterization of Zm-well-covered graphs for some classes of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:293-297 [Journal]
  9. Art S. Finbow, Bert Hartnell
    Well-located graphs: a collection of well-covered ones. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:201-209 [Journal]
  10. Art S. Finbow, Bert Hartnell, Richard J. Nowakowski
    A Characterization of Well Covered Graphs of Girth 5 or Greater. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:57, n:1, pp:44-68 [Journal]
  11. Ernest J. Cockayne, Bert Hartnell
    Edge partitions of complete multipartite graphs into equal length circuits. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:23, n:2-3, pp:174-183 [Journal]
  12. Georg Gunther, Bert Hartnell, Douglas F. Rall
    Star-factors and k-bounded total domination. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:3, pp:197-201 [Journal]
  13. Bert Hartnell, Douglas F. Rall
    A bound on the size of a graph with given order and bondage number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:409-413 [Journal]
  14. Bert Hartnell, William Kocay
    On minimal neighbourhood-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:92, n:1-3, pp:95-105 [Journal]
  15. Art S. Finbow, Bert Hartnell, Carol Whitehead
    A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:153-167 [Journal]
  16. Bert Hartnell, Douglas F. Rall
    Bounds on the bondage number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:128, n:1-3, pp:173-177 [Journal]

  17. On well-covered triangulations: Part II. [Citation Graph (, )][DBLP]


  18. On well-covered triangulations: Part III. [Citation Graph (, )][DBLP]


  19. Limited packings in graphs. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
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