Reconstructing trees from digitally convex sets
From MaRDI portal
Publication:344865
DOI10.1016/j.dam.2014.08.018zbMath1350.05017OpenAlexW2028254056MaRDI QIDQ344865
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
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating and enumerating digitally convex sets of trees
- Towards a new framework for domination
- Reconstruction of a graph from 2-vicinities of its vertices
- On 3-Steiner simplicial orderings
- A conjecture on the reconstruction of graphs from metric balls of their vertices
- Minimal trees and monophonic convexity
- On the complexity of reconstructing H-free graphs from their Star Systems
- Steiner Trees and Convex Geometries
- Convexity in Graphs and Hypergraphs
- Convexity and HHD-Free Graphs
- Reconstructing a Graph from its Neighborhood Lists
- Local-Global Phenomena in Graphs
- Sequential Operations in Digital Picture Processing
