|
Search the dblp DataBase
Douglas F. Rall:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
Braodcast Chromatic Numbers of Graphs. [Citation Graph (, )][DBLP]
On the packing chromatic number of some lattices. [Citation Graph (, )][DBLP]
Limited packings in graphs. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs
|