Publications in Refereed Conference Proceedings.

 1)   R. D. Dutton and C. B. Millham, Diversions of Northwest water-- computer assessments, Proceedings of the Sixth Annual Symposium on the Interface between Statistics and Computing, Berkley, CA, (Oct., 1972).

 

 2)   Ronald Dutton, Data compression schemes for coordinate-indexing, Fifth Annual Mountain Region Computing Conference, Albuquerque, New Mexico, Oct. 7, 1977.

 

 3)   Ronald D. Dutton and Robert C. Brigham, C-graphs are recognizable and edge-reconstructible, Congressus Numerantium, 29 (1980), pp. 377-387. ( Eleventh Southeastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, March 3-7, 1980.)

 

 4)   Ronald D. Dutton and Robert C. Brigham, INGRID: A Software Tool for Extremal Graph Theory Research, Congressus Numerantium, 39 (1983), pp. 337-352. (Fourteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, Feb. 14-17, 1983.)

 

 5)   Debra Taylor, Ronald D. Dutton, and Robert C. Brigham, Bounds on Nordhaus-Gaddum Type Bounds for Clique Cover Numbers, Congressus Numerantium, 40 (1983), pp. 389-398. (Fourteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, Feb. 14-17, 1983.)

 

 6)   Robert C. Brigham, Phyllis Z. Chinn, and Ronald D. Dutton, On the Clique Graph of the Line Graph, Congressus Numerantium, 43 (1984), pp. 175-190. (Fifteenth Conference on Combinatorics, Graph Theory, and Computing, Baton Rouge, LA, 1984.)

 

 7)   Ronald D. Dutton and Robert C. Brigham, Strong, Weak and Other Colorings of Uniform Hypergraphs, Congressus Numerantium, 47 (1985), pp. 299-314. (Sixteenth Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, Feb. 11-15, 1985.)

 

 8)   Robert C. Brigham and Ronald D. Dutton, Neighborhood Numbers, New Invariants of Undirected Graphs, Congressus Numerantium, 53 (1986), pp. 121-132. (Seventeenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, Feb. 10-14, 1986.)

 

 9)   Ronald D. Dutton and Robert C. Brigham, Bounds on some graph invariants as a function of girth, Congressus Numerantium, 59 (1987), pp. 13-22. (Eighteenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, Feb. 23-27, 1987.)

 

10)  James W. Boland, Robert C. Brigham, and Ronald D. Dutton, The difference between a neighborhood graph and a wheel, Congressus Numerantium, 58 (1987), pp. 151-156. (Eighteenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, Feb. 23-27, 1987.)

 

11)  Ronald D. Dutton and Robert C. Brigham, A software system for bounding graphical invariants, Third New Mexico Symposium on Graph Theoretic Models in Computer Science, Las Cruces, New Mexico, November 6-7, 1987 (Invited).

 

12)  Richard E. Newman-Wolfe, Ronald D. Dutton and Robert C. Brigham, Connecting sets in graphs, Congressus Numerantium, 67 (1988), pp. 67-76. (Nineteenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Louisiana State University, Baton Rouge, LA, Feb. 15-19, 1988.)

 

13)  Teresa Haynes Rice, Robert C. Brigham, and Ronald D. Dutton, Extremal 2-2 insensitive graphs, Congressus Numerantium, 67 (1988), pp. 158-166. (Nineteenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Louisiana State University, Baton Rouge, LA, Feb. 15-19, 1988.)

 

14)  Robert C. Brigham and Ronald D. Dutton, Changing and unchanging invariants: the edge clique cover number, Congressus Numerantium, 70 (1990), pp. 145-152. (Twentieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, Feb. 20-24, 1989.)

 

15)  Teresa W. Haynes, Linda M. Lawson, Robert C. Brigham, and Ronald D. Dutton, Changing and unchanging of the graphical invariants: minimum and maximum degree, maximum clique size, node independence number and edge independence number, Congressus Numerantium, 72 (1990), pp. 239-252. ( Twentieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, Feb. 20-24, 1989.)

 

16)  Robert C. Brigham and Ronald D. Dutton, Distances and diameters in Steinhaus graphs, Congressus Numerantium, 76 (1990), pp. 7-14. (Twenty-first Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, Feb. 12-16, 1990.)

 

17)  Robert C. Brigham, Ronald D. Dutton, and Julie R. Carrington, Embedding graphs in Steinhaus graphs, Fifth International Las Cruces Conference on Graph Theoretic Models in Computer Science, New Mexico State University, Las Cruces, New Mexico, March 9-10, 1990 (Invited).

 

18)  Ronald D. Dutton and Robert C. Brigham, Compatible committees, Congressus Numerantium, 83 (1991), pp 161-166. (Twenty-second Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Louisiana State University, Baton Rouge, LA, Feb. 11-15, 1991.)

 

19)  Ronald D. Dutton, Robert C. Brigham, and Narsingh Deo, On Pascal graphs, Congressus Numerantium 90 (1992), pp. 141-150. (Twenty-third Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, Feb. 22-26, 1992.)

 

20)  Robert C. Brigham, Ronald D. Dutton, F. R. McMorris, and Joe B. Mize, On p-edge clique covers of graphs, Congressus Numerantium 93 (1993), pp. 149-157. (Twenty-fourth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, Feb. 22-26, 1993.)

 

21)  R. D. Dutton, R. C. Brigham, and S. Medidi, On changing and unchanging radius, Conference on Graphs and Matrices, University of Colorado, Boulder, CO, May 7-8, 1993 (Invited).

 

22)  Robert C. Brigham and Ronald D. Dutton, Nordhaus-Gaddum results for the p-vertex clique cover number, Congressus Numerantium 100 (1994), pp. 125-128. (Proceedings of the Twenty-fifth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, March 7-11, 1994.)

 

23)  Ronald D. Dutton and Robert C. Brigham, Deleted subgraph isomorphism, Congressus Numerantium 110 (1995), pp. 145-152. (Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, March 6-10, 1995.)

 

24)  Ronald D. Dutton and Rodney O. Rogers, Properties of the rotation graph of binary trees, Congressus Numerantium 109 (1995), pp. 51-63. (Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, March 6-10, 1995.)

 

25)  Robert C. Brigham, Julie R. Carrington, Ronald D. Dutton, and Richard P. Vitray, An extremal problem related to the bandwidth of bipartite graphs, Congressus Numerantium 119(1996), pp. 123-128. (Twenty seventh Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Louisiana State University, Baton Rouge, LA, Feb. 19-23, 1996.)

 

26)  Rodney O. Rogers and Ronald D. Dutton, On distance in the rotation graph of binary trees, Congressus Numerantium 120 (1996) pp. 103-114. (Twenty seventh Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Louisiana State University, Baton Rouge, LA, Feb. 19-23, 1996.)

 

27)  Ronald D. Dutton and Robert C. Brigham, Domination in claw-free graphs, Congressus Numerantium 132 (1998) pp. 69-75. (Twenty ninth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, March, 1998.)

 

28)    Ronald D. Dutton and Robert C. Brigham, Binary tree partitions, Congressus Numerantium (1999) (Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, March 8-12, 1999.)

 

29)    Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, and Ping Zhang, On graphs with prescribed full domination numbers, Congressus Numerantium 149 (2001) pp. 5-17. (Thirty-Second Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Louisiana State University, Baton Rouge, LA, Feb 26-March 2, 2001.)

 

30)    Chao Gui and Ronald D. Dutton, On the relation between indegree and outdegree distributions in random digraphs, Congressus Numerantium 150 (2001) pp. 87-95. (Thirty-Second Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Louisiana State University, Baton Rouge, LA, Feb 26-March 2, 2001.)

 

31)  Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, and Ping Zhang, Isometric embeddings of bipartite graphs, Congressus Numerantium 154 (2002) pp. 7-12. (Thirty-Third  Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 4-8, 2002.)

 

32)  Khurram H. Shafique and R. D. Dutton, On satisfactory partitioning of graphs, Congressus Numerantium 154 (2002), pp. 183-194. (Thirty-Third  Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 4-8, 2002.)

 

33)  Khurram H. Shafique and Ronald Dutton, Maximum alliance-free and minimum alliance-cover sets, Congressus Numerantium 162 (2003), pp. 139-146. (Thirty-fourth  Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 3-7, 2003)

 

34)  Robert C. Brigham, Ronald D. Dutton, and Stephen T. Hedetniemi, A sharp lower bound on the powerful alliance number of . (Thirty-Fifth  Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 8-12, 2004.)

 

35)  Khurram H. Shafique and Ronald Dutton, On X-free covers, Congressus Numerantium 170 (2004), pp. 193-201. (Thirty-Fifth  Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 8-12, 2004.)

 

36) A. Cami, H. Balakrishnan, N. Deo, and R. Dutton, On the complexity of some global alliance problems, 18th Midwest Conference on Combinatorics, Cryptography and Computing, Rochester, NY, Oct. 28-30, 2004.

 

37) Matt Gordon, G. Gordon Worley II, and Ronald D. Dutton, Reducing the problem of finding security number, Congressus Numerantium 182 (2006), pp. 201-205. (Thirty-seventh Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 6-10, 2006.)

 

38) Ronald Dutton, Secure set algorithms and complexity, Congressus Numerantium 180 (2006), pp. 115-121. (Thirty-seventh Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 6-10, 2006.)

 

39) Rosa I. Enciso and Ronald D. Dutton, Lower bounds for global alliances on planar graphs, (Thirty-eighth Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 511, 2007.)

 

40) Rosa I. Enciso and Ronald D. Dutton, Parameterized complexity of secure sets, Congressus Numerantium 189 (2008), pp 161-168 (Thirty-ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 37, 2008.)

 

41) Yiu Yu Ho and Ronald D. Dutton, A dynamic programming model for k-packing and other invariants on trees, Thirty-ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 37, 2008.

 

42) Rosa I. Enciso and Ronald D. Dutton, Parameterized complexity of secure sets, Workshop on Graph Decomposition: Theoretical, Algorithmic and Logical Aspects, CIRM, Marseille, France, April, 2008.

 

43) Rosa I. Enciso and Ronald D. Dutton, Classical and parameterized complexity of alliances and secure sets, I Seminario Internacional en Informatica, Universidad Nacional San Antonio Abad del Cusco, Peru, March, 2008.