The following pages link to Convexity and HHD-Free Graphs (Q4255812):
Displaying 24 items.
- Generating and enumerating digitally convex sets of trees (Q295254) (← links)
- Reconstructing trees from digitally convex sets (Q344865) (← links)
- On the Carathéodory number of interval and graph convexities (Q392186) (← links)
- On the geodeticity of the contour of a graph (Q479045) (← links)
- Graphs with a minimal number of convex sets (Q489304) (← links)
- On finite convexity spaces induced by sets of paths in graphs (Q533760) (← links)
- Eccentricity function in distance-hereditary graphs (Q784475) (← links)
- The induced path function, monotonicity and betweenness (Q968160) (← links)
- Local Steiner convexity (Q1024317) (← links)
- Steiner intervals, geodesic intervals, and betweenness (Q1045107) (← links)
- On 3-Steiner simplicial orderings (Q1045119) (← links)
- Duchet-type theorems for powers of HHD-free graphs (Q1377865) (← links)
- Finding a central vertex in an HHD-free graph (Q1408816) (← links)
- The convexity of induced paths of order three and applications: complexity aspects (Q1701089) (← links)
- On the contour of bipartite graphs (Q1752491) (← links)
- On the Steiner, geodetic and hull numbers of graphs (Q1779492) (← links)
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- Induced path transit function, monotone and Peano axioms (Q1887635) (← links)
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem (Q1962066) (← links)
- Geodetic convexity parameters for \((q, q - 4)\)-graphs (Q2030436) (← links)
- Convex geometries over induced paths with bounded length (Q2092354) (← links)
- Computing the hull and interval numbers in the weakly toll convexity (Q6131192) (← links)
- On the monophonic convexity in complementary prisms (Q6140247) (← links)
- Walk Domination and HHD-Free Graphs (Q6489357) (← links)
