Reconstructing the n-connected components of a graph

DOI10.1007/BF01838185MaRDI QIDQ2558232zbMATH OpenOpenAlexFDO

Authors R. L. Hemminger, Donald L. Greenwell

Publication date 1973

Published in Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/136320

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites work

• A congruence theorem for trees
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 3258862 (Why is no real title available?)
• On Ulam's conjecture for separable graphs

Cited in

(6)

• On the edge-reconstruction of 3-connected planar graphs with minimum valency 4
• Bipartite permutation graphs are reconstructible
• The converse of Kelly's lemma and control-classes in graph reconstruction
• A survey on edge reconstruction of graphs
• Trees with at least 6 +11 vertices are -reconstructible
• Acyclic graphs with at least 2 + 1 vertices are -recognizable

This page was built for publication: Reconstructing the n-connected components of a graph

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