✦ 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
DOI: 10.2478/s12175-010-0002-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Discrete optimization in partially order

Discrete optimization in partially ordered sets

✍ S. Sadiq Basha 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 115 KB

Affine Isomorphism for Partially Ordered

Affine Isomorphism for Partially Ordered Sets

✍ James Allen Fill; Donniell E. Fishkind; Edward R. Scheinerman 📂 Article 📅 1998 🏛 Springer Netherlands 🌐 English ⚖ 92 KB

On the isomorphism of partially ordered

On the isomorphism of partially ordered sets

✍ Alexander Abian 📂 Article 📅 1971 🏛 Springer 🌐 English ⚖ 98 KB

Partially ordered sets and k-decomposabi

Partially ordered sets and k-decomposability

✍ S. S. Kislitsym 📂 Article 📅 1967 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 299 KB

Minimizing the jump number for partially

Minimizing the jump number for partially ordered sets: A graph-theoretic approach

✍ Maciej M. Sysło 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 737 KB

Cut-sets in infinite graphs and partial

Cut-sets in infinite graphs and partial orders

✍ 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