2008 |
26 | EE | Michael O. Albertson,
Debra L. Boutin:
Automorphisms and Distinguishing Numbers of Geometric Cliques.
Discrete & Computational Geometry 39(4): 778-785 (2008) |
2007 |
25 | EE | Michael O. Albertson,
Debra L. Boutin:
Using Determining Sets to Distinguish Kneser Graphs.
Electr. J. Comb. 14(1): (2007) |
2006 |
24 | EE | Michael O. Albertson,
Bojan Mohar:
Coloring Vertices and Faces of Locally Planar Graphs.
Graphs and Combinatorics 22(3): 289-295 (2006) |
23 | EE | Michael O. Albertson,
Douglas B. West:
Extending precolorings to circular colorings.
J. Comb. Theory, Ser. B 96(4): 472-481 (2006) |
22 | EE | Michael O. Albertson,
Debra L. Boutin:
Distinguishing geometric graphs.
Journal of Graph Theory 53(2): 135-150 (2006) |
2005 |
21 | EE | Michael O. Albertson:
Distinguishing Cartesian Powers of Graphs.
Electr. J. Comb. 12: (2005) |
2004 |
20 | EE | Michael O. Albertson,
Glenn G. Chappell,
Henry A. Kierstead,
André Kündgen,
Radhika Ramamurthi:
Coloring with no 2-Colored P4's.
Electr. J. Comb. 11(1): (2004) |
19 | EE | Michael O. Albertson,
Joan P. Hutchinson:
Extending precolorings of subgraphs of locally planar graphs.
Eur. J. Comb. 25(6): 863-871 (2004) |
18 | EE | Michael O. Albertson,
Alexandr V. Kostochka,
Douglas B. West:
Precoloring Extensions of Brooks' Theorem.
SIAM J. Discrete Math. 18(3): 542-553 (2004) |
2002 |
17 | EE | Michael O. Albertson,
Joan P. Hutchinson:
Graph Color Extensions: When Hadwiger's Conjecture and Embeddings Help.
Electr. J. Comb. 9(1): (2002) |
2001 |
16 | EE | Michael O. Albertson,
Emily H. Moore:
Extending graph colorings using no extra colors.
Discrete Mathematics 234(1-3): 125-132 (2001) |
2000 |
15 | EE | Michael O. Albertson,
Sara Grossman,
Ruth Haas:
Partial list colorings.
Discrete Mathematics 214(1-3): 235-240 (2000) |
1999 |
14 | EE | Michael O. Albertson,
Emily H. Moore:
Extending Graph Colorings.
J. Comb. Theory, Ser. B 77(1): 83-95 (1999) |
1998 |
13 | EE | Michael O. Albertson:
You Can't Paint Yourself into a Corner.
J. Comb. Theory, Ser. B 73(2): 189-194 (1998) |
1997 |
12 | | Michael O. Albertson:
The Irregularity of a Graph.
Ars Comb. 46: (1997) |
11 | EE | Michael O. Albertson,
Ruth Haas:
The edge chromatic difference sequence of a cubic graph.
Discrete Mathematics 177(1-3): 1-8 (1997) |
1996 |
10 | EE | Michael O. Albertson,
Ruth Haas:
Parsimonious edge coloring.
Discrete Mathematics 148(1-3): 1-7 (1996) |
9 | EE | Michael O. Albertson,
Karen L. Collins:
Symmetry Breaking in Graphs.
Electr. J. Comb. 3(1): (1996) |
1994 |
8 | EE | Michael O. Albertson,
Debra L. Boutin:
Lower bounds for constant degree independent sets.
Discrete Mathematics 127(1-3): 15-21 (1994) |
1992 |
7 | EE | Michael O. Albertson:
Turán theorems with repeated degrees.
Discrete Mathematics 100(1-3): 235-241 (1992) |
1991 |
6 | EE | Michael O. Albertson,
David M. Berman:
The number of cut-vertices in a graph of given minimum degree.
Discrete Mathematics 89(1): 97-100 (1991) |
1989 |
5 | EE | Michael O. Albertson,
Robert E. Jamison,
Stephen T. Hedetniemi,
Stephen C. Locke:
The subchromatic number of a graph.
Discrete Mathematics 74(1-2): 33-49 (1989) |
1985 |
4 | EE | Michael O. Albertson,
Karen L. Collins:
Homomorphisms of 3-chromatic graphs.
Discrete Mathematics 54(2): 127-132 (1985) |
1984 |
3 | EE | Michael O. Albertson,
Karen L. Collins:
Duality and perfection for edges in cliques.
J. Comb. Theory, Ser. B 36(3): 298-309 (1984) |
1980 |
2 | EE | Michael O. Albertson,
David M. Berman:
Critical graphs for chromatic difference sequences.
Discrete Mathematics 31(3): 225-233 (1980) |
1 | EE | Michael O. Albertson,
David M. Berman:
The chromatic difference sequence of a graph.
J. Comb. Theory, Ser. B 29(1): 1-12 (1980) |