𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Disproof of a conjecture in graph reconstruction theory

✍ Scribed by Dezső Miklós

Publisher
Springer-Verlag
Year
1992
Tongue
English
Weight
155 KB
Volume
12
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Disproof of a conjecture about independe
Disproof of a conjecture about independent branchings in k-connected directed graphs
✍ Andreas Huck 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB 👁 1 views

## Abstract For each __k__ ≥ 3, we construct a finite directed strongly __k__‐connected graph __D__ containing a vertex __t__ with the following property: For any __k__ spanning __t__‐branchings, __B__~1~, …, __B__~__k__~ in __D__ (i. e., each __B__~__i__~ is a spanning tree in __D__ directed towar

Reductions of the Graph Reconstruction C
Reductions of the Graph Reconstruction Conjecture
✍ R. Statman 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 283 KB

In this note we shall show that the Graph Reconstruction Conjecture (also called the Kelly-Ulam conjecture [l, p. 1 I]) is equivalent to a conjecture about the algebraic properties of certain directed trees and their homomorphic images. We shall also show that the Graph Reconstruction Conjecture is