The following pages link to On the convexity number of graphs (Q1926045):
Displayed 14 items.
- Complexity aspects of the triangle path convexity (Q277613) (← links)
- Graphs with a minimal number of convex sets (Q489304) (← links)
- Inapproximability results for graph convexity parameters (Q496002) (← links)
- Convex \(p\)-partitions of bipartite graphs (Q897926) (← links)
- The convexity of induced paths of order three and applications: complexity aspects (Q1701089) (← links)
- Geodetic convexity parameters for \((q, q - 4)\)-graphs (Q2030436) (← links)
- A necessary condition for the equality of the clique number and the convexity number of a graph (Q2127622) (← links)
- A note on the convexity number of the complementary prisms of trees (Q2161269) (← links)
- On finding convex cuts in general, bipartite and plane graphs (Q2402674) (← links)
- The strong convexity spectra of grids (Q2409510) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)
- Geodetic Convexity Parameters for Graphs with Few Short Induced Paths (Q3181044) (← links)
- Algorithmic Aspects of Monophonic Convexity (Q3503548) (← links)
- \textsc{Minimum Surgical Probing} with convexity constraints (Q6182899) (← links)