Claw-free graphs are edge reconstructible.
Mark N. EllinghamLászló PyberXingxing YuPublished in: J. Graph Theory (1988)
Keyphrases
- weighted graph
- undirected graph
- minimum spanning trees
- edge information
- edge detection
- graph matching
- graph structure
- graph theoretic
- graph clustering
- graph partitioning
- adjacency graph
- vertex set
- structured objects
- edge weights
- graph databases
- graph isomorphism
- graph representation
- graph model
- edge detector
- directed graph
- disjoint paths
- complex structures
- series parallel
- adjacency matrix
- image segmentation
- spanning tree
- graph theory
- multiscale