Generating and enumerating digitally convex sets of trees
From MaRDI portal
Publication:295254
DOI10.1007/s00373-015-1604-8zbMath1338.05042OpenAlexW868478150MaRDI QIDQ295254
Timothy Pressey, Philip Lafrance, Ortrud R. Oellermann
Publication date: 13 June 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-015-1604-8
bounds for the number of digitally convex sets of treesenumerating digitally convex sets of cographs in linear timegenerating digitally convex sets of treesproperties of digitally convex sets
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Graphs with a minimal number of convex sets
- Towards a new framework for domination
- Enumeration of subtrees of trees
- Binary trees with the largest number of subtrees
- On 3-Steiner simplicial orderings
- Complement reducible graphs
- Closure systems and their structure
- On subtrees of trees
- On the spectrum and number of convex sets in graphs
- Minimal trees and monophonic convexity
- Steiner Trees and Convex Geometries
- A Linear Recognition Algorithm for Cographs
- Convexity in Graphs and Hypergraphs
- The Complexity of Enumeration and Reliability Problems
- Convexity and HHD-Free Graphs
- Sequential Operations in Digital Picture Processing