scientific article
From MaRDI portal
Publication:3636215
zbMath1175.05096MaRDI QIDQ3636215
No author found.
Publication date: 30 June 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (5)
Reconstruction of distance hereditary 2-connected graphs ⋮ Unnamed Item ⋮ Reconstruction and edge reconstruction of triangle-free graphs ⋮ Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible ⋮ Degree associated edge reconstruction number of split graphs with biregular independent set is one
This page was built for publication:
