Structure theorems for some circular-arc graphs. - Alan Tucker (Discret. Math., 1974)

Critical perfect graphs and perfect 3-chromatic graphs. - Alan Tucker (J. Comb. Theory B, 1977)

A Note on Convergence of the Ford-Fulkerson Flow Algorithm. - Alan Tucker (Math. Oper. Res., 1977)

Uniquely colorable perfect graphs. - Alan Tucker (Discret. Math., 1983)

Coloring graphs with stable cutsets. - Alan Tucker (J. Comb. Theory B, 1983)

An O(qn) algorithm to q-color a proper family of circular arcs. - Austin Teng; Alan Tucker (Discret. Math., 1985)

A reduction procedure for coloring perfect K4-free graphs. - Alan Tucker (J. Comb. Theory B, 1987)

Coloring perfect (K4 - e)-free graphs. - Alan Tucker (J. Comb. Theory B, 1987)

Balanced matrices with row sum 3. - Alan Tucker (Discret. Math., 1994)

Colorings and Related Topics. - Zsolt Tuza; Gregory Z. Gutin; Michael Plurnmer; Alan Tucker; Edmund Kieran Burke; Dominique de Werra; Jeffrey H. Kingston (Handbook of Graph Theory, 2003)

Polynomial time recognition of unit circular-arc graphs. - Guillermo Durán; Agustín Gravano; Ross M. McConnell; Jeremy P. Spinrad; Alan Tucker (J. Algorithms, 2006)

What Every Mathematician Should Know about Standards-Based Tests. - Alan Tucker (Am. Math. Mon., 2011)

The History of the Undergraduate Program in Mathematics in the United States. - Alan Tucker (Am. Math. Mon., 2013)