๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Information and preference in partial orders: A bimatrix representation

โœ Scribed by Wade D. Cook; Moshe Kress; Lawrence M. Seiford


Book ID
112726614
Publisher
Springer
Year
1986
Tongue
English
Weight
631 KB
Volume
51
Category
Article
ISSN
0033-3123

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Cut-sets in infinite graphs and partial
โœ A. Hajnal; N. Sauer ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 859 KB

Hajnal, A. and N. Sauer, Cut-sets in infinite graphs and partial orders. Discrete Mathematics 117 (1993) 113-125. The set S c V(U) is a cut-set of the vertex v of a graph 9 if v is not adjacent to any vertex in S and, for every maximal clique C of Q, ({v} u S) n C # 0. S is a cut-set of the element