Premium
Nearly acyclic graphs are reconstructible
Author(s) -
Manvel Bennet,
Weinstein Joseph M.
Publication year - 1978
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190020105
Subject(s) - mathematics , combinatorics , automorphism , graph , discrete mathematics
We prove that a graph G is reconstructible if G has a node v with G‐v acyclic. The proof uses colored graphs and shows how to reconstruct some graphs from pieces which share a common subgraph having few automorphisms.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom