Michael O. Albertson

L. Clark Seelye Professor

Department of Mathematics and Statistics
Department of Computer Science (founding member)
Smith College
Northampton, Massachusetts USA



1946-2009



[Publications] [Videotaped Lectures] [Memorial Conference] [Remembrances] [Coauthor Graph]



Last updated September 2010

Publications

[Textbook] [Book Reviews] [1973-1979] [1980-1989] [1990-1999] [2000-2011]



TEXTBOOK



BOOK REVIEWS



ARTICLES 2000-2011

A Smith College undergraduate coauthor is denoted by *

  1. Albertson, Michael O.; Pach, Janos, Young, Michael E. Disjoint Homometric Sets in Graphs, to appear in Ars Mathematica Contemporanea in 2011. Preprint coming soon to this page.
  2. Albertson, Michael O.; Boutin, Debra L., Gethner, Ellen. More Results on r-Inflated Graphs: Arboricity, Thickness, Chromatic Number, and Fractional Chromatic Number , to appear in Ars Mathematica Contemporanea in 2011.
  3. Albertson, Michael O.; Boutin, Debra L., Gethner, Ellen. The thickness and chromatic number of r-inflated graphs , to appear in Discrete Math 2010.
  4. Albertson, Michael O.; Alpert, Hannah; belcastro, sarah-marie; Haas, Ruth. Grünbaum colorings of toroidal triangulations , Journal of Graph Theory 63 (2010), no. 1, 68-81.
  5. Albertson, Michael O.; Cranston, Daniel; Fox Jacob. Crossings, colorings, and cliques, Electron. J. Combin. 16 (2009), no. 1, Research Paper 45, 11 pp. (electronic).
  6. Albertson, Michael O. Chromatic number, independence ratio, and crossing number. Ars Math. Contemp.1 (2008), no. 1, 1-6.
  7. Albertson, Michael O.; Boutin, Debra L. Automorphisms and distinguishing numbers of geometric cliques. Discrete Comput. Geom. 39 (2008), no. 4, 778-785.
  8. Albertson, Michael O.; Boutin, Debra L. Using determining sets to distinguish Kneser graphs. Electron. J. Combin. 14 (2007), no. 1, Research Paper 20, 9 pp. (electronic).
  9. Albertson, Michael O.; Mohar, Bojan Coloring vertices and faces of locally planar graphs. Graphs Combin. 22 (2006), no. 3, 289-295.
  10. Albertson, Michael O.; Boutin, Debra L. Distinguishing geometric graphs. J. Graph Theory 53 (2006), no. 2, 135-150.
  11. Albertson, Michael O.; West, Douglas B. Extending precolorings to circular colorings. J. Combin. Theory Ser. B 96 (2006), no. 4, 472-481.
  12. Albertson, Michael O. Distinguishing Cartesian powers of graphs. Electron. J. Combin. 12 (2005), Note 17, 5 pp. (electronic).
  13. Albertson, Michael O.; Kostochka, Alexandr V.; West, Douglas B. Precoloring extensions of Brooks' theorem. SIAM J. Discrete Math. 18 (2004/05), no. 3, 542-553 (electronic).
  14. Albertson, Michael O.; Hutchinson, Joan P. Extending precolorings of subgraphs of locally planar graphs. European J. Combin. 25 (2004), no. 6, 863-871.
  15. Albertson, Michael O.; Chappell, Glenn G.; Kierstead, H. A.; Kundgen, Andre; Ramamurthi, Radhika Coloring with no 2-colored P4's. Electron. J. Combin. 11 (2004), no. 1, Research Paper 26, 13 pp. (electronic).
  16. Albertson, Michael O.; Hutchinson, Joan P. Graph color extensions: when Hadwiger's conjecture and embeddings help. Electron. J. Combin. 9 (2002), no. 1, Research Paper 37, 10 pp. (electronic).
  17. Albertson, Michael O. Coloring, computational complexity, and culture. Mitt. Dtsch. Math.-Ver. 2002, no. 1, 26-29.
  18. Albertson, Michael O.; Boutin, Debra L. The isometry dimension and orbit number of a finite group. Proceedings of the Thirty-second Southeastern International Conference on Combinatorics, Graph Theory and Computing (Baton Rouge, LA, 2001). Congr. Numer. 150 (2001), 79-85.
  19. Albertson, Michael O.; Moore, Emily H. Extending graph colorings using no extra colors. Discrete Math. 234 (2001), no. 1-3, 125-132.
  20. Albertson, Michael O.; Hutchinson, Joan P. Extending colorings of locally planar graphs. J. Graph Theory 36 (2001), no. 2, 105-116.
  21. Albertson, Michael O.; Boutin, Debra L. Realizing finite groups in Euclidean space. J. Algebra 225 (2000), no. 2, 947-956.
  22. Albertson, Michael O.; Grossman*, Sara; Haas, Ruth. Partial list colorings. Discrete Math. 214 (2000), no. 1-3, 235-240.


ARTICLES 1990-1999

  1. Albertson, Michael O.; Collins, Karen L. A note on breaking the symmetries of tournaments. Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1999). Congr. Numer. 136 (1999), 129-131.
  2. Albertson, Michael O.; Moore, Emily H. Extending graph colorings. J. Combin. Theory Ser. B 77 (1999), no. 1, 83-95.
  3. Albertson, Michael O. Sometimes you don't need extra colors. New York Graph Theory Day, 36 (Staten Island, NY, 1998). Graph Theory Notes N. Y. 36 (1999), 22-24.
  4. Albertson, Michael O. You can't paint yourself into a corner. J. Combin. Theory Ser. B 73 (1998), no. 2, 189-194.
  5. Albertson, Michael O.; Haas, Ruth The edge chromatic difference sequence of a cubic graph. Discrete Math. 177 (1997), no. 1-3, 1-8.
  6. Albertson, Michael O. The irregularity of a graph. Ars Combin. 46 (1997), 219-225.
  7. Albertson, Michael O.; Collins, Karen L. An introduction to symmetry breaking in graphs. New York Graph Theory Day, 30 (Madison, NJ, 1995). Graph Theory Notes N. Y. 30 (1996), 6-7.
  8. Albertson, Michael O.; Collins, Karen L. Symmetry breaking in graphs. Electron. J. Combin. 3 (1996), no. 1, Research Paper 18, approx. 17 pp. (electronic).
  9. Albertson, Michael O.; Haas, Ruth Bounding functions and rigid graphs. SIAM J. Discrete Math. 9 (1996), no. 2, 269-273.
  10. Albertson, Michael O.; Haas, Ruth Parsimonious edge coloring. Discrete Math. 148 (1996), no. 1-3, 1-7.
  11. Albertson, Michael; Haas, Ruth; O'Rourke, Joseph Some results on clamping a polygon. Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1995). Congr. Numer. 109 (1995), 33-50.
  12. Albertson, Michael O. People who know people. Math. Mag. 67 (1994), no. 4, 278-281.
  13. Albertson, Michael O.; Boutin*, Debra L. Lower bounds for constant degree independent sets. Graph theory and applications (Hakone, 1990). Discrete Math. 127 (1994), no. 1-3, 15-21.
  14. Albertson, Michael O.; Chan*, Lily; Haas, Ruth Independence and graph homomorphisms. J. Graph Theory 17 (1993), no. 5, 581-588.
  15. Albertson, Michael O. Turan theorems with repeated degrees. Special volume to mark the centennial of Julius Petersen's ``Die Theorie der regularen Graphs'', Part I. Discrete Math. 100 (1992), no. 1-3, 235-241.
  16. Albertson, Michael O.; Berman, David M. Ramsey graphs without repeated degrees. Proceedings of the Twenty-second Southeastern Conference on Combinatorics, Graph Theory, and Computing (Baton Rouge, LA, 1991). Congr. Numer. 83 (1991), 91-96.
  17. Albertson, Michael O.; Berman, David M. The number of cut-vertices in a graph of given minimum degree. Discrete Math. 89 (1991), no. 1, 97-100.
  18. Albertson, Michael O.; Berman, David M.; Hutchinson, Joan P.; Thomassen, Carsten. Graphs with homeomorphically irreducible spanning trees. J. Graph Theory 14 (1990), no. 2, 247-258.
  19. Albertson, Michael O. The accidental mathematician. Notices American Mathematical Society 37 No. 2 (1990), 213-215.


ARTICLES 1980-1989

  1. Albertson, M. O.; Jamison, R. E.; Hedetniemi, S. T.; Locke, S. C. The subchromatic number of a graph. Graph colouring and variations. Discrete Math. 74 (1989), no. 1-2, 33-49.
  2. Albertson, Michael O. Generalized independence in graphs, Proceedings of the Japanese Information Processing Society: Algorithms 6-4 (1989), 1-5.
  3. Albertson, Michael O. Finding Hamiltonian cycles in Ore graphs. Eighteenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, Fla., 1987). Congr. Numer. 58 (1987), 25-27.
  4. Albertson, Michael O. Generalized colorings. Discrete algorithms and complexity (Kyoto, 1986), 35-49, Perspect. Comput., 15, Academic Press, Boston, MA, 1987.
  5. Albertson, Michael O.; Booth*, Victoria. Homomorphisms of symmetric graphs. Proceedings of the seventeenth Southeastern international conference on combinatorics, graph theory, and computing (Boca Raton, Fla., 1986). Congr. Numer. 53 (1986), 79-86.
  6. Albertson, Michael O.; Catlin, Paul A.; Gibbons*, Luana. Homomorphisms of 3-chromatic graphs. II. Proceedings of the sixteenth Southeastern international conference on combinatorics, graph theory and computing (Boca Raton, Fla., 1985). Congr. Numer. 47 (1985), 19-28.
  7. Albertson, Michael O.; Collins*, Karen L. Homomorphisms of 3-chromatic graphs. Discrete Math. 54 (1985), no. 2, 127-132.
  8. Albertson, Michael O.; Collins*, Karen L. Duality and perfection for edges in cliques. J. Combin. Theory Ser. B 36 (1984), no. 3, 298-309.
  9. Albertson, Michael O.; Berman, David M. Combinatorial aspects of the orrery model of syntax. SIAM J. Algebraic Discrete Methods 5 (1984), no. 3, 451-456.
  10. Albertson, Michael O.; Berman, David M. Cliques, colorings, and locally perfect graphs. Proceedings of the fourteenth Southeastern conference on combinatorics, graph theory and computing (Boca Raton, Fla., 1983). Congr. Numer. 39 (1983), 69-73.
  11. Albertson, Michael O.; Stromquist, Walter R. Locally planar toroidal graphs are 5-colorable. Proc. Amer. Math. Soc. 84 (1982), no. 3, 449-457.
  12. Albertson, Michael O.; O'Keefe*, Claire J. Covering regions with squares. SIAM J. Algebraic Discrete Methods 2 (1981), no. 3, 240-243.
  13. Albertson, Michael O.; Hutchinson, Joan P. On six-chromatic toroidal graphs. Proc. London Math. Soc. (3) 41 (1980), no. 3, 533-556.
  14. Albertson, Michael O.; Berman, David M. The chromatic difference sequence of a graph. J. Combin. Theory Ser. B 29 (1980), no. 1, 1-12.
  15. Albertson, Michael O.; Berman, David M. Critical graphs for chromatic difference sequences. Discrete Math. 31 (1980), no. 3, 225-233.
  16. Albertson, Michael O.; Hutchinson, Joan P. Hadwiger's conjecture for graphs on the Klein bottle. Discrete Math. 29 (1980), no. 1, 1-11.


ARTICLES 1973-1979

  1. Albertson, Michael O.; Hutchinson, Joan P. Hadwiger's conjecture and six-chromatic toroidal graphs. Graph theory and related topics (Proc. Conf., Univ. Waterloo, Waterloo, Ont., 1977), pp. 35-40, Academic Press, New York-London, 1979.
  2. Albertson, M. O.; Berman, D. M. A conjecture on planar graphs. Graph Theory and Related Topics (J. A. Bondy and U. S. R. Murty, eds.), (Academic Press, 1979), 357.
  3. Albertson, Michael O.; Hutchinson, Joan P. The three excluded cases of Dirac's map-color theorem. Second International Conference on Combinatorial Mathematics (New York, 1978), pp. 7-17, Ann. New York Acad. Sci., 319, New York Acad. Sci., New York, 1979.
  4. Albertson, Michael O.; Hutchinson, Joan P. On the independence ratio of a graph. J. Graph Theory 2 (1978), no. 1, 1-8.
  5. Albertson, Michael O.; Berman, David M. An acyclic analogue to Heawood's theorem. Glasgow Math. J. 19 (1978), no. 2, 163-166.
  6. Albertson, Michael O.; Berman, David M. Every planar graph has an acyclic 7-coloring. Israel J. Math. 28 (1977), no. 1-2, 169-174.
  7. Albertson, Michael O.; Hutchinson, Joan P. The independence ratio and genus of a graph. Trans. Amer. Math. Soc. 226 (1977), 161-173.
  8. Albertson, Michael O.; Berman, David M. The acyclic chromatic number. Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory, and Computing (Louisiana State Univ., Baton Rouge, La., 1976), pp. 51-69. Congressus Numerantium, No. XVII, Utilitas Math., Winnipeg, Man., 1976.
  9. Albertson, Michael; Bollobas, Bela; Tucker*, Susan. The independence ratio and maximum degree of a graph. Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory, and Computing (Louisiana State Univ., Baton Rouge, La., 1976), pp. 43-50. Congressus Numerantium, No. XVII, Utilitas Math., Winnipeg, Man., 1976.
  10. Albertson, Michael O. A lower bound for the independence number of a planar graph. J. Combinatorial Theory Ser. B 20 (1976), no. 1, 84-93.
  11. Albertson, Michael O.; Hutchinson, Joan P. The maximum size of an independent set in a toroidal graph. Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1975), pp. 35-46. Congressus Numerantium, No. XIV, Utilitas Math., Winnipeg, Man., 1975.
  12. Albertson, Michael O.; Hutchinson, Joan P. The maximum size of an independent set in a nonplanar graph. Bull. Amer. Math. Soc.. 81 (1975), 554-555.
  13. Albertson, Michael O. Finding an independent set in a planar graph. Graphs and combinatorics (Proc. Capital Conf., George Washington Univ., Washington, D.C., 1973), pp. 173-179.
  14. Albertson, Michael O. Forbidden and unavoidable subgraphs in the Erdös-Vizing problem. Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1974), pp. 179-186. Congressus Numerantium, No. X, Utilitas Math., Winnipeg, Man., 1974.
  15. Albertson, Michael O. On irreducible graphs. Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1973), pp. 125-129. Utilitas Math., Winnipeg, Man., 1973.
  16. Albertson, Michael O.; Wilf, Herbert S. Boundary values in the four color problem. Trans. Amer. Math. Soc. 181 (1973), 471-482.
  17. Albertson, Michael O.; Wilf, Herbert S. Boundary values in chromatic graph theory. Bull. Amer. Math. Soc. 79 (1973), 464.
  18. Albertson, Michael O. A case of Hadwiger's conjecture. Discrete Math. 4 (1973), 197-199.


VIDEOTAPED LECTURES

  1. Independence Ratios of Nearly Planar Graphs. Sixth Slovenian International Conference on Graph Theory, Bled 2007.
  2. Extending graph colorings. Graph Coloring Workshop, Simon Fraser University, Burnaby, BC, Canada, 2000.


REMEMBRANCES

visitors since 21 March 2009