A New Graph Colouring Algorithm. - Ronald D. Dutton; Robert C. Brigham (Comput. J., 1981)

Graphs which, with their complements, have certain clique covering numbers. - Robert C. Brigham; Ronald D. Dutton (Discret. Math., 1981)

Complexity of a proposed database storage structure. - Robert C. Brigham; Ronald D. Dutton; James R. Driscoll (Inf. Syst., 1981)

Generalized k-tuple colorings of cycles and other graphs. - Robert C. Brigham; Ronald D. Dutton (J. Comb. Theory B, 1982)

The Complexity of a Multiprocessor Task Assignment Problem without Deadlines. - Ronald D. Dutton; Robert C. Brigham (Theor. Comput. Sci., 1982)

Efficiently identifying the faces of a solid. - Ronald D. Dutton; Robert C. Brigham (Comput. Graph., 1983)

A characterization of competition graphs. - Ronald D. Dutton; Robert C. Brigham (Discret. Appl. Math., 1983)

On clique covers and independence numbers of graphs. - Robert C. Brigham; Ronald D. Dutton (Discret. Math., 1983)

Upper bounds on the edge clique cover number of a graph. - Robert C. Brigham; Ronald D. Dutton (Discret. Math., 1984)

Bounds on graph spectra. - Robert C. Brigham; Ronald D. Dutton (J. Comb. Theory B, 1984)

A compilation of relations between graph invariants. - Robert C. Brigham; Ronald D. Dutton (Networks, 1985)

Extension of a clique cover result to uniform hypergraphs. - A. Patricia Shelton; Ronald D. Dutton; Robert C. Brigham (Discret. Math., 1986)

Computationally Efficient Bounds for the Catalan Numbers. - Ronald D. Dutton; Robert C. Brigham (Eur. J. Comb., 1986)

An extremal problem for edge domination insensitive graphs. - Ronald D. Dutton; Robert C. Brigham (Discret. Appl. Math., 1988)

Vertex domination-critical graphs. - Robert C. Brigham; Phyllis Z. Chinn; Ronald D. Dutton (Networks, 1988)

On the size of graphs of a given bandwidth. - Ronald D. Dutton; Robert C. Brigham (Discret. Math., 1989)

INGRID: A Graph Invariant Manipulator. - Ronald D. Dutton; Robert C. Brigham; Fernando Gomez (J. Symb. Comput., 1989)

Factor domination in graphs. - Robert C. Brigham; Ronald D. Dutton (Discret. Math., 1990)

Edges in graphs with large girth. - Ronald D. Dutton; Robert C. Brigham (Graphs Comb., 1991)

A compilation of relations between graph invariants - supplement I. - Robert C. Brigham; Ronald D. Dutton (Networks, 1991)

Weak-Heap Sort. - Ronald D. Dutton (BIT, 1993)

Extremal Graphs Domination Insensitive to the Removal of k Edges. - Teresa W. Haynes; Robert C. Brigham; Ronald D. Dutton (Discret. Appl. Math., 1993)

On the radius and diameter of the clique graph. - Ronald D. Dutton; Robert C. Brigham (Discret. Math., 1995)

Inversions in k-sorted Permutations. - Ronald D. Dutton (Discret. Appl. Math., 1998)

An Equation Involving the Neighborhood (Two-Step) and Line Graphs. - Mary M. Miller; Robert C. Brigham; Ronald D. Dutton (Ars Comb., 1999)

An extremal bandwidth problem for bipartite graphs. - Robert C. Brigham; Julie R. Carrington; Ronald D. Dutton; Joseph Fiedler; Richard P. Vitray (J. Graph Theory, 2000)

Full domination in graphs. - Robert C. Brigham; Gary Chartrand; Ronald D. Dutton; Ping Zhang 004 (Discuss. Math. Graph Theory, 2001)

Edge-recognizable domination numbers. - Ronald D. Dutton; Robert C. Brigham; Chao Gui (Discret. Math., 2003)

On the dimension of trees. - Robert C. Brigham; Gary Chartrand; Ronald D. Dutton; Ping Zhang 004 (Discret. Math., 2005)

Security in graphs. - Robert C. Brigham; Ronald D. Dutton; Stephen T. Hedetniemi (Discret. Appl. Math., 2007)

Bounds on Powerful Alliance Numbers. - Robert C. Brigham; Ronald D. Dutton (Ars Comb., 2008)

Bounds on a graph's security number. - Ronald D. Dutton; Robert Lee; Robert C. Brigham (Discret. Appl. Math., 2008)

Powerful alliances in graphs. - Robert C. Brigham; Ronald D. Dutton; Teresa W. Haynes; Stephen T. Hedetniemi (Discret. Math., 2009)

On a graph's security number. - Ronald D. Dutton (Discret. Math., 2009)

On global domination critical graphs. - Ronald D. Dutton; Robert C. Brigham (Discret. Math., 2009)

Partitioning a graph into alliance free sets. - Khurram Shafique; Ronald D. Dutton (Discret. Math., 2009)

Global Domination and Packing Numbers. - Ronald D. Dutton (Ars Comb., 2011)

Global secure sets of grid-like graphs. - Yiu Yu Ho; Ronald D. Dutton (Discret. Appl. Math., 2011)

Edge dominating sets and vertex covers. - Ronald D. Dutton; William Klostermeyer (Discuss. Math. Graph Theory, 2013)

Color Stable Graphs. - Ronald D. Dutton; Robert C. Brigham (Bull. ICA, 2017)

A new graph coloring scheme. - Ronald D. Dutton; Robert C. Brigham (Bull. ICA, 2019)