Reconstructing trees from digitally convex sets
DOI10.1016/J.DAM.2014.08.018zbMATH Open1350.05017OpenAlexW2028254056MaRDI QIDQ344865FDOQ344865
Timothy Pressey, Ortrud R. Oellermann, Philip Lafrance
Publication date: 24 November 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.08.018
Recommendations
digital convexityrecognizing families of digitally convex sets of treesreconstructing graphs from their family of digitally convex sets
Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convexity in Graphs and Hypergraphs
- On 3-Steiner simplicial orderings
- Minimal trees and monophonic convexity
- Generating and enumerating digitally convex sets of trees
- Steiner Trees and Convex Geometries
- Convexity and HHD-Free Graphs
- Title not available (Why is that?)
- Sequential Operations in Digital Picture Processing
- Towards a new framework for domination
- A conjecture on the reconstruction of graphs from metric balls of their vertices
- On the complexity of reconstructing H-free graphs from their Star Systems
- Reconstructing a Graph from its Neighborhood Lists
- Local-Global Phenomena in Graphs
- Reconstruction of a graph from 2-vicinities of its vertices
Cited In (4)
- Computing the Euler characteristic and related additive functionals of digital objects from their bintree representation
- Generating and enumerating digitally convex sets of trees
- Recognizing Geometric Trees as Positively Weighted Straight Skeletons and Reconstructing Their Input
- Recovering Trees with Convex Clustering
This page was built for publication: Reconstructing trees from digitally convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344865)
