The following pages link to Alan C. Tucker (Q1110542):
Displaying 25 items.
- (Q3216653) (← links)
- (Q3218158) (← links)
- An O(N2) algorithm for coloring perfect planar graphs (Q3323978) (← links)
- A matroid related to finitely chainlike, countably infinite networks (Q3331162) (← links)
- (Q3661340) (← links)
- (Q3680855) (← links)
- (Q3866122) (← links)
- An Efficient Test for Circular-Arc Graphs (Q3900112) (← links)
- (Q3946199) (← links)
- Polya's Enumeration Formula by Example (Q4050601) (← links)
- Coloring a Family of Circular Arcs (Q4071258) (← links)
- A New Applicable Proof of the Euler Circuit Theorem (Q4103564) (← links)
- (Q4173373) (← links)
- A Note on Convergence of the Ford-Fulkerson Flow Algorithm (Q4181630) (← links)
- (Q4305278) (← links)
- (Q4328327) (← links)
- The use of negative penalty functions in solving partial differential equations (Q4667895) (← links)
- The History of the Undergraduate Program in Mathematics in the United States (Q5404027) (← links)
- Polynomial time recognition of unit circular-arc graphs (Q5468870) (← links)
- Characterizing circular-arc graphs (Q5602682) (← links)
- (Q5612483) (← links)
- (Q5641181) (← links)
- (Q5659564) (← links)
- The Strong Perfect Graph Conjecture for Planar Graphs (Q5663885) (← links)
- Perfect Graphs and an Application to Optimizing Municipal Services (Q5668500) (← links)
