Smooth graphs satisfy a five-point metric condition, are closed under specific products and amalgams, and among Ptolemaic graphs are precisely the induced-K1,1,3-free ones.
Report 2405.07512, arXiv
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Geodesic halfspace separation is polynomial-time solvable on weakly bridged graphs, pseudo-modular graphs, and matroid basis graphs.
citing papers explorer
-
Smooth Graphs
Smooth graphs satisfy a five-point metric condition, are closed under specific products and amalgams, and among Ptolemaic graphs are precisely the induced-K1,1,3-free ones.
-
Halfspace separation in geodesic convexity
Geodesic halfspace separation is polynomial-time solvable on weakly bridged graphs, pseudo-modular graphs, and matroid basis graphs.