Conference Papers in Refereed Proceedings

  1. R. D. Dutton and C. B. Milham, 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. (Proceedings of the 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. (Proceedings of the fourteenth South eastern 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. (Proceedings of the 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. (Proceedings of the 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. (Proceedings o the 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. (Proceedings of the Seventeenth Souteastern 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. (Proceedings of the Eighteenth South eastern 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. (Proceedings of the 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. (Proceedings of the 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. (Proceedings of the 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. (Proceedings of the Twenti eth Southeastern International Conference on Combinatorics, Graph Theory, and Com puting, 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. (Proceedings of the Twentieth, Southeastern International Confer ence 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. (Proceedings of the Twentyfirst Southeastern Interna tional 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. (Proceedings of the 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. (Proceedings of the Twentythird 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. (Proceedings of the Twentyfourth 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 Twentyfifth 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 (1995) (Proceedings of the Twentysixth Southeastern International Conference on Combinato rics, 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 (1995) (Proceedings of the Twentysixth Southeastern International Confer ence 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. (Proceedings of the 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. (Proceedings of the 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. (Proc. Of 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. (Proc. Of 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 CmxCn, 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, Thirty-Fifth Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 8-12, 2004.