SCEAS

The SCEAS System

Title:
Author:

Alan Tucker: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Guillermo Durán, Agustín Gravano, Ross M. McConnell, Jeremy Spinrad, Alan Tucker
Polynomial time recognition of unit circular-arc graphs. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2006, v:58, n:1, pp:67-78 [Journal]
Alan Tucker
Coloring graphs with stable cutsets. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1983, v:34, n:3, pp:258-267 [Journal]
Alan Tucker
A reduction procedure for coloring perfect K₄-free graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:151-172 [Journal]
Alan Tucker
Coloring perfect (K₄ - e)-free graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1987, v:42, n:3, pp:313-318 [Journal]
Alan Tucker
Critical perfect graphs and perfect 3-chromatic graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1977, v:23, n:1, pp:143-149 [Journal]
Alan Tucker
Uniquely colorable perfect graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1983, v:44, n:2, pp:187-194 [Journal]
Austin Teng, Alan Tucker
An O(qn) algorithm to q-color a proper family of circular arcs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1985, v:55, n:2, pp:233-243 [Journal]
Alan Tucker
Balanced matrices with row sum 3. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1994, v:132, n:1-3, pp:395-398 [Journal]

Search in 0.087secs, Finished in 0.088secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP