Minimal trees and monophonic convexity

DOI10.7151/dmgt.1638zbMath1293.05314OpenAlexW2087046441MaRDI QIDQ2866415

No author found.

Publication date: 13 December 2013

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1638

zbMATH Keywords

convex geometriesminimal trees\(k\)-monophonic convexitymonophonic intervals of sets

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Perfect graphs (05C17)

Related Items

Generating and enumerating digitally convex sets of trees ⋮ A general framework for path convexities ⋮ Reconstructing trees from digitally convex sets ⋮ Graphs with a minimal number of convex sets ⋮ Separation properties of 3-Steiner and 3-monophonic convexity in graphs ⋮ On the spectrum and number of convex sets in graphs