| 2008 |
|---|
| 29 | | Robert C. Brigham,
Ronald D. Dutton:
Bounds on Powerful Alliance Numbers.
Ars Comb. 88: (2008) |
| 28 | EE | Ronald D. Dutton,
Robert Lee,
Robert C. Brigham:
Bounds on a graph's security number.
Discrete Applied Mathematics 156(5): 695-704 (2008) |
| 2007 |
|---|
| 27 | EE | Robert C. Brigham,
Ronald D. Dutton,
Stephen T. Hedetniemi:
Security in graphs.
Discrete Applied Mathematics 155(13): 1708-1714 (2007) |
| 2005 |
|---|
| 26 | EE | Robert C. Brigham,
Gary Chartrand,
Ronald D. Dutton,
Ping Zhang:
On the dimension of trees.
Discrete Mathematics 294(3): 279-283 (2005) |
| 25 | EE | Robert C. Brigham,
Teresa W. Haynes,
Michael A. Henning,
Douglas F. Rall:
Bicritical domination.
Discrete Mathematics 305(1-3): 18-32 (2005) |
| 2004 |
|---|
| 24 | EE | Robert C. Brigham,
Julie R. Carrington,
Richard P. Vitray:
Extremal connected graphs for independent domination number.
Discrete Mathematics 275(1-3): 299-309 (2004) |
| 2003 |
|---|
| 23 | | Robert C. Brigham,
Julie R. Carrington,
Richard P. Vitray,
Donna J. Williams,
Jay Yellen:
Change in Additive Bandwidth When an Edge is Added.
Ars Comb. 68: (2003) |
| 22 | EE | Ronald D. Dutton,
Robert C. Brigham,
Chao Gui:
Edge-recognizable domination numbers.
Discrete Mathematics 272(1): 47-51 (2003) |
| 2000 |
|---|
| 21 | | Robert C. Brigham,
Julie R. Carrington,
Richard P. Vitray:
Domination Sequences.
Ars Comb. 57: (2000) |
| 1999 |
|---|
| 20 | | Mary M. Miller,
Robert C. Brigham,
Ronald D. Dutton:
An Equation Involving the Neighborhood (Two-Step) and Line Graphs.
Ars Comb. 52: (1999) |
| 19 | | Robert C. Brigham,
Julie R. Carrington,
Richard P. Vitray:
Bipartite Graphs and Absolute Difference Tolerances.
Ars Comb. 54: (1999) |
| 1996 |
|---|
| 18 | EE | Robert C. Brigham,
Fred R. McMorris,
Richard P. Vitray:
Two - ø - Tolerance Competition Graphs.
Discrete Applied Mathematics 66(2): 101-108 (1996) |
| 1995 |
|---|
| 17 | EE | Ronald D. Dutton,
Robert C. Brigham:
On the radius and diameter of the clique graph.
Discrete Mathematics 147(1-3): 293-295 (1995) |
| 1993 |
|---|
| 16 | EE | Teresa W. Haynes,
Robert C. Brigham,
Ronald D. Dutton:
Extremal Graphs Domination Insensitive to the Removal of k Edges.
Discrete Applied Mathematics 44(1-3): 295-304 (1993) |
| 1990 |
|---|
| 15 | EE | Robert C. Brigham,
Ronald D. Dutton:
Factor domination in graphs.
Discrete Mathematics 86(1-3): 127-136 (1990) |
| 1989 |
|---|
| 14 | EE | Ronald D. Dutton,
Robert C. Brigham:
On the size of graphs of a given bandwidth.
Discrete Mathematics 76(3): 191-195 (1989) |
| 13 | | Ronald D. Dutton,
Robert C. Brigham,
Fernando Gomez:
INGRID: A Graph Invariant Manipulator.
J. Symb. Comput. 7(2): 163-177 (1989) |
| 1988 |
|---|
| 12 | EE | Ronald D. Dutton,
Robert C. Brigham:
An extremal problem for edge domination insensitive graphs.
Discrete Applied Mathematics 20(2): 113-125 (1988) |
| 1986 |
|---|
| 11 | EE | A. Patricia Shelton,
Ronald D. Dutton,
Robert C. Brigham:
Extension of a clique cover result to uniform hypergraphs.
Discrete Mathematics 59(1-2): 199-201 (1986) |
| 1984 |
|---|
| 10 | EE | Robert C. Brigham,
Ronald D. Dutton:
Upper bounds on the edge clique cover number of a graph.
Discrete Mathematics 52(1): 31-37 (1984) |
| 9 | EE | Robert C. Brigham,
Ronald D. Dutton:
Bounds on graph spectra.
J. Comb. Theory, Ser. B 37(3): 228-234 (1984) |
| 1983 |
|---|
| 8 | EE | Ronald D. Dutton,
Robert C. Brigham:
Efficiently identifying the faces of a solid.
Computers & Graphics 7(2): 143-147 (1983) |
| 7 | EE | Robert C. Brigham,
Ronald D. Dutton:
On clique covers and independence numbers of graphs.
Discrete Mathematics 44(2): 139-144 (1983) |
| 1982 |
|---|
| 6 | EE | Robert C. Brigham,
Ronald D. Dutton:
Generalized k-tuple colorings of cycles and other graphs.
J. Comb. Theory, Ser. B 32(1): 90-94 (1982) |
| 5 | | Ronald D. Dutton,
Robert C. Brigham:
The Complexity of a Multiprocessor Task Assignment Problem without Deadlines.
Theor. Comput. Sci. 17: 213-216 (1982) |
| 1981 |
|---|
| 4 | | Ronald D. Dutton,
Robert C. Brigham:
A New Graph Colouring Algorithm.
Comput. J. 24(1): 85-86 (1981) |
| 3 | EE | Robert C. Brigham,
Ronald D. Dutton:
Graphs which, with their complements, have certain clique covering numbers.
Discrete Mathematics 34(1): 1-7 (1981) |
| 2 | | Robert C. Brigham,
Ronald D. Dutton,
James R. Driscoll:
Complexity of a proposed database storage structure.
Inf. Syst. 6(1): 47-52 (1981) |
| 1961 |
|---|
| 1 | EE | Robert C. Brigham,
P. D. Burgess:
Generalized Simulation of Post Office Systems.
J. ACM 8(2): 252-259 (1961) |
