Alan Tucker

According to our database1, Alan Tucker authored at least 13 papers between 1974 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
The History of the Undergraduate Program in Mathematics in the United States.
Am. Math. Mon., 2013

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

2006
Polynomial time recognition of unit circular-arc graphs.
J. Algorithms, 2006

2003
Colorings and Related Topics.
Proceedings of the Handbook of Graph Theory., 2003

1994
Balanced matrices with row sum 3.
Discret. Math., 1994

1987
Coloring perfect (<i>K</i><sub><i>4</i></sub><i> - e</i>)-free graphs.
J. Comb. Theory, Ser. B, 1987

A reduction procedure for coloring perfect <i>K</i><sub><i>4</i></sub>-free graphs.
J. Comb. Theory, Ser. B, 1987

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

1983
Coloring graphs with stable cutsets.
J. Comb. Theory, Ser. B, 1983

Uniquely colorable perfect graphs.
Discret. Math., 1983

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

Critical perfect graphs and perfect 3-chromatic graphs.
J. Comb. Theory, Ser. B, 1977

1974
Structure theorems for some circular-arc graphs.
Discret. Math., 1974


  Loading...