scientific article; zbMATH DE number 3299378
From MaRDI portal
Publication:5581298
Cited in
(15)- Graphical partially ordered sets
- The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks
- On the reconstruction of separable graphs from elementary contractions
- The edge reconstruction hypothesis is true for graphs with more than n _2\,n edges
- On reconstructing graphs from their sets of subgraphs
- The centroidal branches of a separable graph are edge reconstructible
- Edge-recognizable domination numbers.
- Reconstruction of the set of branches of a graph
- Reconstruction of maximal outerplanar graphs
- A note on the line reconstruction problem
- Reconstructing the degree pair sequence of a digraph
- Bemerkungen zur Ulam-Vermutung
- Reconstructing Graphs
- Reconstructing Graphs
- Fixing subgraphs and Ulam's conjecture
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5581298)
