Set Recognition of Decomposable Graphs and Steps Towards Their Reconstruction

Document Type

Article

Publication Date

1-3-2022

Department

Mathematics

School

Mathematics and Natural Sciences

Abstract

It is proved that decomposable graphs are set recognizable and that the index graph of the canonical decomposition as well as the graphs induced on the maximal autonomous sets of vertices are set reconstructible. From these results, we obtain set reconstructibility for many decomposable graphs as well as a concise description of the decomposable graphs for which set reconstruction remains an open problem.

Publication Title

Abhandlungen aus dem Mathematischen Seimar der Universität Hamburg

Volume

92

First Page

1

Last Page

25

Find in your library

Share

COinS