In this paper we introduce the notion of \textit{convexity}, a natural restriction of triangle convexity. A \textit{triangle path} is a path allowing just short chords. A triangle path between two non-adjacent vertices in a graph is called \textit{path} if the first vertex of is among vertices from adjacent only to the second vertex of , and the last vertex of is among vertices from adjacent only to the second-last vertex of . A set is
A characterization of chordal graph without sun and co-rising sun as convex geometry
Silvia B. Tondato
