Minimal trees and monophonic convexity

DOI10.7151/DMGT.1638zbMATH Open1293.05314OpenAlexW2087046441MaRDI QIDQ2866415FDOQ2866415

Authors: Jose Cáceres, Ortrud R. Oellermann, M. L. Puertas 

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

Recommendations

• Local \(3\)-monophonic convexity
• Steiner trees and convex geometries
• Separation properties of 3-Steiner and 3-monophonic convexity in graphs
• Convex sets in graphs. II: Minimal path convexity
• Algorithmic Aspects of Monophonic Convexity

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (14)

• A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes
• Local \(3\)-monophonic convexity
• Title not available (Why is that?)
• Minimal dynamics for tree maps
• The tree alternative conjecture under the topological minor relation
• Separation properties of 3-Steiner and 3-monophonic convexity in graphs
• Generating and enumerating digitally convex sets of trees
• Reconstructing trees from digitally convex sets
• Graphs with a minimal number of convex sets
• Minimal nonstandard Coxeter trees
• Convexity of minimal dominating functions of trees. II
• Steiner trees and convex geometries
• Convex subgraph polynomials of degree 3 or 4, rooted and co-normal products of graphs
• On the spectrum and number of convex sets in graphs

This page was built for publication: Minimal trees and monophonic convexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866415)