✦ LIBER ✦

Computer reconstruction of small graphs

✍ Scribed by B. D. McKay

Publisher: John Wiley and Sons
Year: 1977
Tongue: English
Weight: 114 KB
Volume: 1
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190010309

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The Reconstruction Conjecture is established for graphs with nine vertices.

📜 SIMILAR VOLUMES

Reconstruction of infinite graphs

✍ C.St.J.A. Nash-Williams 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 929 KB

The paper recalls several known results concerning reconstruction and edge-reconstruction of infinite graphs, and draws attention to some possibly interesting unsolved problems.

Small graphs with chromatic number 5: A

Small graphs with chromatic number 5: A computer search

✍ Tommy Jensen; Gordon F. Royle 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 402 KB

## Abstract In this article we give examples of a triangle‐free graph on 22 vertices with chromatic number 5 and a __K__~4~‐free graph on 11 vertices with chromatic number 5. We very briefly describe the computer searches demonstrating that these are the smallest possible such graphs. All 5‐critica

Reconstructibility versus edge reconstru

Reconstructibility versus edge reconstructibility of infinite graphs

✍ Carsten Thomassen 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 151 KB

## RECONgTRUCTIBILITY VERSUI~ EDGE RECONSTR1UCTIBILtlY OF !NF![?CTE GN~APNS Cars,~en -FI-!Ob,~ ASSEN A.hah,,\*~atL~k /~.t;tir~\*., t h~ieersi;e~sp ~tk~'n, S0{P} Aarbus C. Detm~a& Rcc~ .d 23 [;cccm~cr 1~)77 [~¢ :{>.cd 7 April D)TS For every cm~dma! a >R o ~here exi::ts an ,:t-rQ,',ular .g;api~ w[?

The reconstruction of maximal planar gra

The reconstruction of maximal planar graphs II. Reconstruction

✍ J Lauri 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 863 KB

Reconstruction of maximal outerplanar gr

Reconstruction of maximal outerplanar graphs

✍ Bennet Manvel 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 1011 KB

Class-reconstruction of total graphs

✍ David W. Bange; Anthony E. Barkauskas; Linda H. Host 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 533 KB

It is shown that given any vertex-deleted total graph, every reconstruction into a total graph by the addition of a vertex yields the original total graph. The proof indicates how the reconstruction can be done. Hu, for i = 1 , . . . , p , then G Definition. Let C be a class of graphs. A graph G E C