Reconstructing the n-connected components of a graph

DOI10.1007/BF01838185zbMath0255.05125OpenAlexW1997065471MaRDI QIDQ2558232

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)

Related Items (4)

A survey on edge reconstruction of graphs ⋮ BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE ⋮ On the edge-reconstruction of 3-connected planar graphs with minimum valency 4 ⋮ Unnamed Item

Cites Work

• A congruence theorem for trees
• On Ulam's conjecture for separable graphs
• Unnamed Item
• Unnamed Item

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