Reconstructing trees from digitally convex sets

DOI10.1016/J.DAM.2014.08.018MaRDI QIDQ344865zbMATH OpenOpenAlexFDO

Authors Philip Lafrance, Ortrud R. Oellermann, Timothy Pressey

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

zbMATH Keywords

digital convexityrecognizing families of digitally convex sets of treesreconstructing graphs from their family of digitally convex sets

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Generating and enumerating digitally convex sets of trees
• scientific article; zbMATH DE number 3786820
• Convex extendable trees
• Minimal trees and monophonic convexity
• Convex sets in a graph

Cites work

• scientific article; zbMATH DE number 439012 (Why is no real title available?)
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• A conjecture on the reconstruction of graphs from metric balls of their vertices
• Convexity and HHD-Free Graphs
• Convexity in Graphs and Hypergraphs
• Generating and enumerating digitally convex sets of trees
• Local-Global Phenomena in Graphs
• Minimal trees and monophonic convexity
• On 3-Steiner simplicial orderings
• On domination and digital convexity parameters
• On the complexity of reconstructing H-free graphs from their Star Systems
• Reconstructing a Graph from its Neighborhood Lists
• Reconstruction of a graph from 2-vicinities of its vertices
• Sequential Operations in Digital Picture Processing
• Steiner trees and convex geometries
• Towards a new framework for domination

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)