Robert C. Brigham

44 papers Journal 43
YearRankTypeTitle / Venue / Authors
2019 J jnl
A new graph coloring scheme.
Bull. ICA
Ronald D. Dutton, Robert C. Brigham
2017 J jnl
Color Stable Graphs.
Bull. ICA
Ronald D. Dutton, Robert C. Brigham
2009 J jnl
On global domination critical graphs.
Discret. Math.
Ronald D. Dutton, Robert C. Brigham
2009 J jnl
Powerful alliances in graphs.
Discret. Math.
Robert C. Brigham, Ronald D. Dutton, Teresa W. Haynes, Stephen T. Hedetniemi
2008 J jnl
Bounds on Powerful Alliance Numbers.
Ars Comb.
Robert C. Brigham, Ronald D. Dutton
2008 J jnl
Bounds on a graph's security number.
Discret. Appl. Math.
Ronald D. Dutton, Robert Lee, Robert C. Brigham
2007 J jnl
Security in graphs.
Discret. Appl. Math.
Robert C. Brigham, Ronald D. Dutton, Stephen T. Hedetniemi
2005 J jnl
Bicritical domination.
Discret. Math.
Robert C. Brigham, Teresa W. Haynes, Michael A. Henning, Douglas F. Rall
2005 J jnl
On the dimension of trees.
Discret. Math.
Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang
2004 J jnl
Extremal connected graphs for independent domination number.
Discret. Math.
Robert C. Brigham, Julie R. Carrington, Richard P. Vitray
2003 J jnl
Change in Additive Bandwidth When an Edge is Added.
Ars Comb.
Robert C. Brigham, Julie R. Carrington, Richard P. Vitray, Donna J. Williams, Jay Yellen
2003 J jnl
Edge-recognizable domination numbers.
Discret. Math.
Ronald D. Dutton, Robert C. Brigham, Chao Gui
2003 — ch.
Graphical Measurement.
Handbook of Graph Theory
Gary Chartrand, Ping Zhang, Teresa W. Haynes, Michael A. Henning, Fred R. McMorris, Robert C. Brigham
2001 J jnl
Full domination in graphs.
Discuss. Math. Graph Theory
Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang
2000 J jnl
An extremal bandwidth problem for bipartite graphs.
J. Graph Theory
Robert C. Brigham, Julie R. Carrington, Ronald D. Dutton, Joseph Fiedler, Richard P. Vitray
2000 J jnl
Domination Sequences.
Ars Comb.
Robert C. Brigham, Julie R. Carrington, Richard P. Vitray
1999 J jnl
An Equation Involving the Neighborhood (Two-Step) and Line Graphs.
Ars Comb.
Mary M. Miller, Robert C. Brigham, Ronald D. Dutton
1999 J jnl
Bipartite Graphs and Absolute Difference Tolerances.
Ars Comb.
Robert C. Brigham, Julie R. Carrington, Richard P. Vitray
1996 J jnl
Two - ø - Tolerance Competition Graphs.
Discret. Appl. Math.
Robert C. Brigham, Fred R. McMorris, Richard P. Vitray
1995 J jnl
On the radius and diameter of the clique graph.
Discret. Math.
Ronald D. Dutton, Robert C. Brigham
1993 J jnl
Extremal Graphs Domination Insensitive to the Removal of
Discret. Appl. Math.
Teresa W. Haynes, Robert C. Brigham, Ronald D. Dutton
1991 J jnl
A compilation of relations between graph invariants - supplement I.
Networks
Robert C. Brigham, Ronald D. Dutton
1991 J jnl
Edges in graphs with large girth.
Graphs Comb.
Ronald D. Dutton, Robert C. Brigham
1990 J jnl
Factor domination in graphs.
Discret. Math.
Robert C. Brigham, Ronald D. Dutton
1989 J jnl
INGRID: A Graph Invariant Manipulator.
J. Symb. Comput.
Ronald D. Dutton, Robert C. Brigham, Fernando Gomez
1989 J jnl
On the size of graphs of a given bandwidth.
Discret. Math.
Ronald D. Dutton, Robert C. Brigham
1988 J jnl
An extremal problem for edge domination insensitive graphs.
Discret. Appl. Math.
Ronald D. Dutton, Robert C. Brigham
1988 J jnl
Vertex domination-critical graphs.
Networks
Robert C. Brigham, Phyllis Z. Chinn, Ronald D. Dutton
1986 J jnl
Computationally Efficient Bounds for the Catalan Numbers.
Eur. J. Comb.
Ronald D. Dutton, Robert C. Brigham
1986 J jnl
Extension of a clique cover result to uniform hypergraphs.
Discret. Math.
A. Patricia Shelton, Ronald D. Dutton, Robert C. Brigham
1985 J jnl
A compilation of relations between graph invariants.
Networks
Robert C. Brigham, Ronald D. Dutton
1984 J jnl
Bounds on graph spectra.
J. Comb. Theory B
Robert C. Brigham, Ronald D. Dutton
1984 J jnl
Upper bounds on the edge clique cover number of a graph.
Discret. Math.
Robert C. Brigham, Ronald D. Dutton
1983 J jnl
A characterization of competition graphs.
Discret. Appl. Math.
Ronald D. Dutton, Robert C. Brigham
1983 J jnl
Efficiently identifying the faces of a solid.
Comput. Graph.
Ronald D. Dutton, Robert C. Brigham
1983 J jnl
On clique covers and independence numbers of graphs.
Discret. Math.
Robert C. Brigham, Ronald D. Dutton
1982 J jnl
Generalized
J. Comb. Theory B
Robert C. Brigham, Ronald D. Dutton
1982 J jnl
The Complexity of a Multiprocessor Task Assignment Problem without Deadlines.
Theor. Comput. Sci.
Ronald D. Dutton, Robert C. Brigham
1981 J jnl
A New Graph Colouring Algorithm.
Comput. J.
Ronald D. Dutton, Robert C. Brigham
1981 J jnl
Complexity of a proposed database storage structure.
Inf. Syst.
Robert C. Brigham, Ronald D. Dutton, James R. Driscoll
1981 J jnl
Graphs which, with their complements, have certain clique covering numbers.
Discret. Math.
Robert C. Brigham, Ronald D. Dutton
1961 J jnl
Generalized Simulation of Post Office Systems.
J. ACM
Robert C. Brigham, P. D. Burgess
1961 J jnl
Some Properties of Binary Counters with Feedback.
IRE Trans. Electron. Comput.
Robert C. Brigham
1959 J jnl
A Translation Routine for the DEUCE Computer.
Comput. J.
Robert C. Brigham, C. Gordon Bell