Some basic observations on Kelly's conjecture for graphs

DOI10.1016/0012-365X(74)90064-8zbMath0285.05124OpenAlexW2063649785WikidataQ123143492 ScholiaQ123143492MaRDI QIDQ1844860

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)

Related Items

Complexity results in graph reconstruction, Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices, 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs, Reconstructing degree sequences from k-vertex-deleted subgraphs, 3-regular graphs are 2-reconstructible, Reconstructing compositions, ON α,β DESTRUCTIBLE GRAPHS, Reconstructing trees from two point deleted subtrees, Graph theory (algorithmic, algebraic, and metric problems)

Cites Work

• Unnamed Item
• A congruence theorem for trees