✦ LIBER ✦

Reconstruction of Posets with the Same Comparability Graph

✍ Scribed by Pierre Ille; Jean-Xavier Rampon

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 221 KB
Volume: 74
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1998.1859

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Packing a tree with a graph of the same

Packing a tree with a graph of the same size

✍ P. J. Slater; S. K. Teo; H. P. Yap 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

## Abstract We prove that if __T__ is a tree of order __p__ ⩾ 5 and __G__ is a graph of order __p__ and size __p__ ‐ 1 such that neither __T__ nor __G__ is a star, then __T__ can be embedded in G, the complement of __G__.

The edge reconstruction of hamiltonian g

The edge reconstruction of hamiltonian graphs

✍ L. Pyber 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 305 KB 👁 1 views

## Abstract If a graph __G__ on __n__ vertices contains a Hamiltonian path, then __G__ is reconstructible from its edge‐deleted subgraphs for __n__ sufficiently large.

Cubic graphs with 62 vertices having the

Cubic graphs with 62 vertices having the same path layer matrix

✍ A. A. Dobrynin 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract The path layer matrix (or path degree sequence) of a graph __G__ contains quantitative information about all paths in __G__. The entry (__i,j__) in this matrix is the number of simple paths in __G__ having initial vertex __v__ and length __j.__ It was known that there are cubic graphs o

Note on the reconstruction of vertex col

Note on the reconstruction of vertex colored graphs

✍ R. Taylor 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB 👁 2 views

Note on the reconstruction of infinite g

Note on the reconstruction of infinite graphs with a fixed finite number of components

✍ Thomas Andreae 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 1 views

For every positive integer c , we construct a pair G, , H, of infinite, nonisomorphic graphs both having exactly c components such that G, and H, are hypomorphic, i.e., G, and H, have the same families of vertex-deleted subgraphs. This solves a problem of Bondy and Hemminger. Furthermore, the pair G

Reconstructing the number of copies of a

Reconstructing the number of copies of a valency-labeled finite graph in an infinite graph

✍ A. J. H. King; C. St. J. A. Nash-Williams 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB 👁 1 views

## Abstract Suppose that __G, H__ are infinite graphs and there is a bijection Ψ; V(G) Ψ V(H) such that __G__ ‐ ξ ≅ H ‐ Ψ(ξ) for every ξ ∼ __V__(G). Let __J__ be a finite graph and /(π) be a cardinal number for each π ≅ __V__(J). Suppose also that either /(π) is infinite for every π ≅ __V__(J) or _