Reconstructing the n-connected components of a graph

DOI10.1007/BF01838185zbMATH Open0255.05125OpenAlexW1997065471MaRDI QIDQ2558232FDOQ2558232

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

• Title not available (Why is that?)
• A congruence theorem for trees
• Title not available (Why is that?)
• On Ulam's conjecture for separable graphs

Cited In (4)

• The converse of Kelly's lemma and control-classes in graph reconstruction
• On the edge-reconstruction of 3-connected planar graphs with minimum valency 4
• Bipartite permutation graphs are reconstructible
• A survey on edge reconstruction of graphs

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)