On-line chain partitions of orders

Theoretical Computer Science

Volumn 175, Issue 2, 1997, Pages 283-292

  Felsner, Stefan ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY; THEOREM PROVING;

ONLINE CHAIN PARTITIONS;

ALGORITHMS;

EID: 0031118663     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00204-6     Document Type: Article

References (4)

1. H.A. Kierstead, An effective version of Dilworth theorem, Trans. Amer. Math. Soc. 268 (1981) 63-77.
2. H.A. Kierstead, Recursive ordered sets, Contemp. Math. 57 (1986) 75-102.
3. H.A. Kierstead, G.F. McNulty and W.T. Trotter, A theory of recursive dimension for ordered sets, Order 1 (1984) 67-82.
4. W.T. Trotter, Combinatorics and Partially Ordered Sets: Dimension Theory (Johns Hopkins Univ. Press, Baltimore, MD, 1992).