Robert C. Brigham

	2009
32		Ronald D. Dutton, Robert C. Brigham: On global domination critical graphs. Discrete Mathematics 309(19): 5894-5897 (2009)
31		Robert C. Brigham, Ronald D. Dutton, Teresa W. Haynes, Stephen T. Hedetniemi: Powerful alliances in graphs. Discrete Mathematics 309(8): 2140-2147 (2009)
	2008
30		Robert C. Brigham, Ronald D. Dutton: Bounds on Powerful Alliance Numbers. Ars Comb. 88: (2008)
29		Ronald D. Dutton, Robert Lee, Robert C. Brigham: Bounds on a graph's security number. Discrete Applied Mathematics 156(5): 695-704 (2008)
	2007
28		Robert C. Brigham, Ronald D. Dutton, Stephen T. Hedetniemi: Security in graphs. Discrete Applied Mathematics 155(13): 1708-1714 (2007)
	2005
27		Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang: On the dimension of trees. Discrete Mathematics 294(3): 279-283 (2005)
26		Robert C. Brigham, Teresa W. Haynes, Michael A. Henning, Douglas F. Rall: Bicritical domination. Discrete Mathematics 305(1-3): 18-32 (2005)
	2004
25		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
24		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)
23		Ronald D. Dutton, Robert C. Brigham, Chao Gui: Edge-recognizable domination numbers. Discrete Mathematics 272(1): 47-51 (2003)
	2000
22		Robert C. Brigham, Julie R. Carrington, Richard P. Vitray: Domination Sequences. Ars Comb. 57: (2000)
	1999
21		Mary M. Miller, Robert C. Brigham, Ronald D. Dutton: An Equation Involving the Neighborhood (Two-Step) and Line Graphs. Ars Comb. 52: (1999)
20		Robert C. Brigham, Julie R. Carrington, Richard P. Vitray: Bipartite Graphs and Absolute Difference Tolerances. Ars Comb. 54: (1999)
	1996
19		Robert C. Brigham, Fred R. McMorris, Richard P. Vitray: Two - ø - Tolerance Competition Graphs. Discrete Applied Mathematics 66(2): 101-108 (1996)
	1995
18		Ronald D. Dutton, Robert C. Brigham: On the radius and diameter of the clique graph. Discrete Mathematics 147(1-3): 293-295 (1995)
	1993
17		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)
	1991
16		Ronald D. Dutton, Robert C. Brigham: Edges in graphs with large girth. Graphs and Combinatorics 7(4): 315-321 (1991)
	1990
15		Robert C. Brigham, Ronald D. Dutton: Factor domination in graphs. Discrete Mathematics 86(1-3): 127-136 (1990)
	1989
14		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		Ronald D. Dutton, Robert C. Brigham: An extremal problem for edge domination insensitive graphs. Discrete Applied Mathematics 20(2): 113-125 (1988)
	1986
11		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		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		Robert C. Brigham, Ronald D. Dutton: Bounds on graph spectra. J. Comb. Theory, Ser. B 37(3): 228-234 (1984)
	1983
8		Ronald D. Dutton, Robert C. Brigham: Efficiently identifying the faces of a solid. Computers & Graphics 7(2): 143-147 (1983)
7		Robert C. Brigham, Ronald D. Dutton: On clique covers and independence numbers of graphs. Discrete Mathematics 44(2): 139-144 (1983)
	1982
6		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		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		Robert C. Brigham, P. D. Burgess: Generalized Simulation of Post Office Systems. J. ACM 8(2): 252-259 (1961)

Coauthor Index

1	P. D. Burgess	[1]
2	Julie R. Carrington	[20] [22] [24] [25]
3	Gary Chartrand	[27]
4	James R. Driscoll	[2]
5	Ronald D. Dutton	[2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [21] [23] [27] [28] [29] [30] [31] [32]
6	Fernando Gomez	[13]
7	Chao Gui	[23]
8	Teresa W. Haynes	[17] [26] [31]
9	Stephen T. Hedetniemi	[28] [31]
10	Michael A. Henning	[26]
11	Robert Lee	[29]
12	Fred R. McMorris	[19]
13	Mary M. Miller	[21]
14	Douglas F. Rall	[26]
15	A. Patricia Shelton	[11]
16	Richard P. Vitray	[19] [20] [22] [24] [25]
17	Donna J. Williams	[24]
18	Jay Yellen	[24]
19	Ping Zhang	[27]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page