Reconstructing degree sequences from k-vertex-deleted subgraphs

DOI10.1016/0012-365X(90)90035-GzbMath0694.05046MaRDI QIDQ908942

Richard Taylor

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

determined by their k-vertex-deleted subgraphsreconstruction of a graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices ⋮ 3-regular graphs are 2-reconstructible

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• A class of graphs for which the Ulam conjecture holds
• Some basic observations on Kelly's conjecture for graphs
• Reconstructing the degree pair sequence of a digraph
• Graph reconstruction—a survey
• On reconstruction of graphs

This page was built for publication: Reconstructing degree sequences from k-vertex-deleted subgraphs