✦ LIBER ✦

The Comparability Graph of a Modular Lattice

✍ Scribed by Takayuki Hibi

Book ID: 106167823
Publisher: Springer-Verlag
Year: 1998
Tongue: English
Weight: 159 KB
Volume: 18
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s004930050039

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graph automorphisms of a finite modular

Graph automorphisms of a finite modular lattice

✍ Ján Jakubík 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 179 KB

The Comparability Graph of a Tree

✍ E. S. Wolk 📂 Article 📅 1962 🏛 American Mathematical Society 🌐 English ⚖ 212 KB

The Complexity of Modular Graph Automorp

The Complexity of Modular Graph Automorphism

✍ Arvind, V.; Beigel, R.; Lozano, A. 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 272 KB

The complexity of comparability graph re

The complexity of comparability graph recognition and coloring

✍ M. C. Golumbic 📂 Article 📅 1977 🏛 Springer Vienna 🌐 English ⚖ 470 KB

Reconstruction of Posets with the Same C

Reconstruction of Posets with the Same Comparability Graph

✍ Pierre Ille; Jean-Xavier Rampon 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Given two finite posets P and P$ with the same comparability graph, we show that if |V(P)| 4 and if for all x # V(P), P&x & P$&x, then P &P$. This result leads us to characterize the finite posets P such that for all x # V(P), P&x & P\*&x.

On determination of graph G whose bond l

On determination of graph G whose bond lattice ℒ(G) is modular

✍ Morimasa Tsuchiya 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 121 KB

We shall prove that a bond lattice .Y(G) of a graph G is Boolean if and only if G is a forest, and that a bond lattice .~(G) is modular if and only if G has no cycle of length n > 3. In this paper, we consider finite undirected simple graphs. For a graph G, V(G) and E(G) denote the set of vertices