Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Lonc, Zbigniew
and
Rival, Ivan
1987.
Chains, antichains, and fibres.
Journal of Combinatorial Theory, Series A,
Vol. 44,
Issue. 2,
p.
207.
Todorcevic, Stevo
1988.
A chain decomposition theorem.
Journal of Combinatorial Theory, Series A,
Vol. 48,
Issue. 1,
p.
65.
Brochet, J. -M.
and
Pouzet, M.
1988.
Maximal chains and cutsets of an ordered set: A menger type approach.
Order,
Vol. 5,
Issue. 3,
p.
289.
Ginsburg, John
Sands, Bill
and
West, Douglas B
1989.
A length-width inequality for partially ordered sets with two-element cutsets.
Journal of Combinatorial Theory, Series B,
Vol. 46,
Issue. 2,
p.
232.
Ginsburg, John
1989.
On then-cutset property.
Order,
Vol. 6,
Issue. 2,
p.
137.
Griggs, Jerrold R.
and
Kleitman, Daniel J.
1989.
Minimum cutsets for an element of a boolean lattice.
Order,
Vol. 6,
Issue. 1,
p.
31.
K�zdy, Andr�
Markert, Matthew
and
West, Douglas B.
1990.
Wide posets with fixed height and cutset number.
Order,
Vol. 7,
Issue. 2,
p.
115.
Milner, E. C.
1990.
The Dilworth Theorems.
p.
30.
Ginsburg, John
1993.
On the dimension of ordered sets with the 2-cutset property.
Order,
Vol. 10,
Issue. 1,
p.
37.
Hajnal, A.
and
Sauer, N.
1993.
Cut-sets in infinite graphs and partial orders.
Discrete Mathematics,
Vol. 117,
Issue. 1-3,
p.
113.
Farley, Jonathan David
and
Schröder, Bernd S. W.
2001.
Strictly Order-Preserving Maps into Z, II. A 1979 Problem of Erné.
Order,
Vol. 18,
Issue. 4,
p.
381.
Duffus, Dwight
2003.
Obituary: Ivan Rival.
Order,
Vol. 20,
Issue. 3,
p.
173.
Foldes, Stephan
and
Woodroofe, Russ
2013.
Antichain Cutsets of Strongly Connected Posets.
Order,
Vol. 30,
Issue. 2,
p.
351.