On reconstructing maximal outerplanar graphs
Copyright policy )On reconstructing maximal outerplanar graphs
Manvel has proved that a maximal outerplanar graph can be reconstructed from the collection of isomorphism types of subgraphs obtained by deleting vertices of the given graph. This paper sharpens Manvel's result by showing that if the graph is not a triangulation of a hexagon, then reconstruction can be accomplished using only those isomorphism types of subgraphs corresponding to deletion of vertices of valence two.
- University of California, Santa Cruz United States
Graph theory, Extremal problems in graph theory, Discrete Mathematics and Combinatorics, Planar graphs; geometric and topological aspects of graph theory, Theoretical Computer Science
Graph theory, Extremal problems in graph theory, Discrete Mathematics and Combinatorics, Planar graphs; geometric and topological aspects of graph theory, Theoretical Computer Science
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!