Some basic observations on Kelly's conjecture for graphs

DOI10.1016/0012-365X(74)90064-8MaRDI QIDQ1844860zbMATH OpenOpenAlexWikidataFDO

Authors Bennet Manvel

Publication date 1974

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(74)90064-8

Mathematics Subject Classification ID

Graph theory (05C99)

Cites work

• A congruence theorem for trees
• scientific article; zbMATH DE number 3258862 (Why is no real title available?)

Cited in

(13)

• Reconstructing trees from two point deleted subtrees
• Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
• 3-regular graphs are 2-reconstructible
• Reconstructing compositions
• ON α,β DESTRUCTIBLE GRAPHS
• Graph theory (algorithmic, algebraic, and metric problems)
• 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs
• Interview with Douglas West
• Trees with at least 6 +11 vertices are -reconstructible
• Acyclic graphs with at least 2 + 1 vertices are -recognizable
• Reconstruction from smaller cards
• Complexity results in graph reconstruction
• Reconstructing degree sequences from k-vertex-deleted subgraphs

This page was built for publication: Some basic observations on Kelly's conjecture for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1844860)