On the weakness of an ordered set

SIAM Journal on Discrete Mathematics

Volumn 11, Issue 4, 1998, Pages 655-663

  Gimbel, John G ^a   Trenk, Ann N ^b  

^a UNIVERSITY OF ALASKA FAIRBANKS   (United States)

^b WELLESLEY COLLEGE   (United States)

Author keywords

Partially ordered sets; Weak orders

Indexed keywords

EID: 0043135699     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480197319628     Document Type: Article

References (6)

1. K. P. BOGART, Introductory Combinatorics, Harcourt Brace Jovanovich, New York, 1980.
2. C. S. CHEN, An Improved Algorithm for Computing Weakness, preliminary report, Wellesley College, Wellesley, MA, 1997.
3. T. GALLAI, Transitiv orientierbare Graphen, Acta Math. Hungar., 18 (1967), pp. 25-66.
4. J. GIMBEL AND C. THOMASSEN, Partial orders on a fixed graph, in Contemporary Methods in Graph Theory, R. Bodendiek, ed., Wissenschaftsverlag, Mannheim, 1990, pp. 305-312.
5. A. N. TRENK, On k-weak orders: Recognition and a tolerance result, Discrete Math., 181 (1998), pp. 223-237.
6. W. T. TROTTER, Combinatorics and Partially Ordered Sets, Johns Hopkins University Press, Baltimore, MD, 1992.