The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Douglas F. Rall: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lisa R. Markus, Douglas F. Rall
    On Seed Graphs with Two Components. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:49, n:, pp:- [Journal]
  2. Scott P. Martin, Jeffrey S. Powell, Douglas F. Rall
    On the independence number of the Cartesian product of caterpillars. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:60, n:, pp:- [Journal]
  3. 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]
  4. 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]
  5. Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall
    On k-dependent domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:249, n:1-3, pp:83-94 [Journal]
  6. Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall
    Acyclic domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:151-165 [Journal]
  7. Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
    Dominating direct products of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:13, pp:1636-1642 [Journal]
  8. 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]
  9. 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]
  10. Jason I. Brown, Richard J. Nowakowski, Douglas F. Rall
    The Ultimate Categorical Independence Ratio of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:2, pp:290-300 [Journal]
  11. Wilfried Imrich, Sandi Klavzar, Douglas F. Rall
    Cancellation properties of products of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:17, pp:2362-2364 [Journal]
  12. Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
    On the packing chromatic number of Cartesian products, hexagonal lattice, and trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:17, pp:2303-2311 [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. Douglas F. Rall
    Domatically critical and domatically full graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:86, n:1-3, pp:81-87 [Journal]
  15. 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]

  16. Braodcast Chromatic Numbers of Graphs. [Citation Graph (, )][DBLP]


  17. On the packing chromatic number of some lattices. [Citation Graph (, )][DBLP]


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


Search in 0.002secs, Finished in 0.003secs
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