Alan C. Tucker

From MaRDI portal
Revision as of 16:10, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Person:1171065 to Alan C. Tucker: Duplicate)

Person:1110542

Available identifiers

zbMath Open tucker.alan-cMaRDI QIDQ1110542

List of research outcomes

PublicationDate of PublicationType
The History of the Undergraduate Program in Mathematics in the United States2014-03-20Paper
https://portal.mardi4nfdi.de/entity/Q31175602012-02-28Paper
https://portal.mardi4nfdi.de/entity/Q31736262011-10-10Paper
What Every Mathematician Should Know about Standards-Based Tests2011-05-20Paper
Polynomial time recognition of unit circular-arc graphs2006-04-28Paper
The use of negative penalty functions in solving partial differential equations2005-04-21Paper
https://portal.mardi4nfdi.de/entity/Q43283271995-03-30Paper
Balanced matrices with row sum 31995-03-02Paper
https://portal.mardi4nfdi.de/entity/Q43052781994-09-13Paper
Greedy packing and series-parallel graphs1988-01-01Paper
Coloring perfect \((K_ 4\)-e)-free graphs1987-01-01Paper
A reduction procedure for coloring perfect \(K_ 4\)-free graphs1987-01-01Paper
An O(qn) algorithm to q-color a proper family of circular arcs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32166531984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32181581984-01-01Paper
An O(N2) algorithm for coloring perfect planar graphs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808551984-01-01Paper
Coloring graphs with stable cutsets1983-01-01Paper
Uniquely colorable perfect graphs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36613401983-01-01Paper
A matroid related to finitely chainlike, countably infinite networks1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38661221980-01-01Paper
An Efficient Test for Circular-Arc Graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39461991979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41733731978-01-01Paper
Critical perfect graphs and perfect 3-chromatic graphs1977-01-01Paper
A Note on Convergence of the Ford-Fulkerson Flow Algorithm1977-01-01Paper
A New Applicable Proof of the Euler Circuit Theorem1976-01-01Paper
Coloring a Family of Circular Arcs1975-01-01Paper
The cost of a class of optimal binary trees1974-01-01Paper
Structure theorems for some circular-arc graphs1974-01-01Paper
Polya's Enumeration Formula by Example1974-01-01Paper
The Strong Perfect Graph Conjecture for Planar Graphs1973-01-01Paper
Perfect Graphs and an Application to Optimizing Municipal Services1973-01-01Paper
A structure theorem for the consecutive 1's property1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56411811972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56595641972-01-01Paper
Matrix characterizations of circular-arc graphs1971-01-01Paper
Characterizing circular-arc graphs1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56124831970-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Alan C. Tucker