The Forcing Convexity Number of a Graph
From MaRDI portal
Recommendations
Cites work
- H-convex graphs
- A characterization of the interval function of a connected graph
- Convexity in graphs
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 1449370 (Why is no real title available?)
- The convexity number of a graph
Cited in
(16)- The \((a,b)\)-forcing geodetic graphs
- The forcing hull and forcing geodetic numbers of graphs
- The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity
- The lower and upper forcing geodetic numbers of block--cactus graphs
- The forcing hull number of a graph
- H-convex graphs
- The lower and upper forcing geodetic numbers of complete n-partite graphs, n-dimensional meshes and tori
- A note on the forcing convexity number of graphs
- scientific article; zbMATH DE number 5139517 (Why is no real title available?)
- Extreme Geodesic Graphs
- On cliques and forcing m-convexity numbers of graphs.
- Forcing subsets for some types of convex sets in a graph
- Forcing super domination number of a graph
- Graphs with large total geodetic number
- scientific article; zbMATH DE number 7528059 (Why is no real title available?)
- THE FORCING CONVEX DOMINATION NUMBER OF A GRAPH
This page was built for publication: The Forcing Convexity Number of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3151365)