Inversions in k-sorted permutationsDUTTON, R. D.Discrete applied mathematics. 1998, Vol 87, Num 1-3, pp 49-56, issn 0166-218XArticle

An extremal problem for edge domination insensitive graphsDUTTON, R. D; BRIGHAM, R. C.Discrete applied mathematics. 1988, Vol 20, Num 2, pp 113-125, issn 0166-218XArticle

Extremal graphs domination insensitive to the removal of k edgesHAYNES, T. W; BRIGHAM, R. C; DUTTON, R. D et al.Discrete applied mathematics. 1993, Vol 44, Num 1-3, pp 295-304, issn 0166-218XArticle

Upper bounds on the edge clique cover number of a graphBRIGHAM, R. C; DUTTON, R. D.Discrete mathematics. 1984, Vol 52, Num 1, pp 31-37, issn 0012-365XArticle

Factor domination in graphsBRIGHAM, R. C; DUTTON, R. D.Discrete mathematics. 1990, Vol 86, Num 1-3, pp 127-136, issn 0012-365X, 10 p.Article

INGRID: a graph invariant manipulatorDUTTON, R. D; BRIGHAM, R. C; GOMEZ, F et al.Journal of symbolic computation. 1989, Vol 7, Num 2, pp 163-177, issn 0747-7171Article

A compilation of relations between graph invariantsBRIGHAM, R. C; DUTTON, R. D.Networks (New York, NY). 1985, Vol 15, Num 1, pp 73-107, issn 0028-3045Article

A compilation of relations between graph invariants―supplement IBRIGHAM, R. C; DUTTON, R. D.Networks (New York, NY). 1991, Vol 21, Num 4, pp 421-455, issn 0028-3045Article

On the size of graphs of a given bandwidthDUTTON, R. D; BRIGHAM, R. C.Discrete mathematics. 1989, Vol 76, Num 3, pp 191-195, issn 0012-365XArticle

Vertex domination-critical graphsBRIGHAM, R. C; CHINN, P. Z; DUTTON, R. D et al.Networks (New York, NY). 1988, Vol 18, Num 3, pp 173-179, issn 0028-3045Article

Extension of a clique cover result to uniform hypergraphsSHELTON, A. P; DUTTON, R. D; BRIGHAM, R. C et al.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 199-201, issn 0012-365XArticle

Bounds on graph spectraBRIGHAM, R. C; DUTTON, R. D.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 3, pp 228-234, issn 0095-8956Article