2014
DOI: 10.12732/ijpam.v95i2.14
|View full text |Cite
|
Sign up to set email alerts
|

Some Results on Reconstructibility of Colored Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
12
0

Year Published

2015
2015
2016
2016

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(12 citation statements)
references
References 8 publications
0
12
0
Order By: Relevance
“…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%
See 4 more Smart Citations
“…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%
See 3 more Smart Citations