𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph isomorphic discrete partially ordered sets and semimodularity

✍ Scribed by Mária Csontóová; Judita Lihová


Book ID
111493072
Publisher
SP Versita
Year
2010
Tongue
English
Weight
406 KB
Volume
60
Category
Article
ISSN
0139-9918

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