“…A basic fact about V-graphs is that a disconnected V-graph is reconstructible. Essentially the same argument (see theorem 3 of [3]) shows that for ā V-graph G, the components together with their vertex partitions are reconstructible. However, it does not follow (at least readily) that G is reconstructible.…”
Section: Basic Factsmentioning
confidence: 83%
“…As in [3] define a V-graph to be a graph, with colors assigned to the vertices (alternatively a C-graph with constant edge color); and an E-graph to be a graph with edge colors. Similarly aV-graph (resp.Ē-graph) is a graph with a vertex (resp.…”
Section: Basic Factsmentioning
confidence: 99%
“…Colored graph reconstructibility has been considered since the early 1970's (see [1]). More recent references include [7], [6], [3]. Using terminology from [3], define a C-graph to be a graph, with colors assigned to the vertices and edges.…”
Section: Introductionmentioning
confidence: 99%
“…More recent references include [7], [6], [3]. Using terminology from [3], define a C-graph to be a graph, with colors assigned to the vertices and edges. C-graphs are called colored graphs in the literature.…”
Section: Introductionmentioning
confidence: 99%
“…Sections 6 and 7 of [3] contain many errors due to confusion of C-reconstructibility withC-reconstructibility, and will be completely revised here.…”
“…A basic fact about V-graphs is that a disconnected V-graph is reconstructible. Essentially the same argument (see theorem 3 of [3]) shows that for ā V-graph G, the components together with their vertex partitions are reconstructible. However, it does not follow (at least readily) that G is reconstructible.…”
Section: Basic Factsmentioning
confidence: 83%
“…As in [3] define a V-graph to be a graph, with colors assigned to the vertices (alternatively a C-graph with constant edge color); and an E-graph to be a graph with edge colors. Similarly aV-graph (resp.Ē-graph) is a graph with a vertex (resp.…”
Section: Basic Factsmentioning
confidence: 99%
“…Colored graph reconstructibility has been considered since the early 1970's (see [1]). More recent references include [7], [6], [3]. Using terminology from [3], define a C-graph to be a graph, with colors assigned to the vertices and edges.…”
Section: Introductionmentioning
confidence: 99%
“…More recent references include [7], [6], [3]. Using terminology from [3], define a C-graph to be a graph, with colors assigned to the vertices and edges. C-graphs are called colored graphs in the literature.…”
Section: Introductionmentioning
confidence: 99%
“…Sections 6 and 7 of [3] contain many errors due to confusion of C-reconstructibility withC-reconstructibility, and will be completely revised here.…”
In earlier papers the author showed that all graphs which are not single-block trunk (SBT) graphs are reconstructible, and that two families of SBT graphs are reconstructible. Here some further families of SBT graphs are shown to be reconstructible.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.