Pages that link to "Item:Q4903647"
From MaRDI portal
The following pages link to CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT (Q4903647):
Displaying 5 items.
- On the geodeticity of the contour of a graph (Q479045) (← links)
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- A necessary condition for the equality of the clique number and the convexity number of a graph (Q2127622) (← links)
- On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent (Q2192072) (← links)
- Two classes of graphs in which some problems related to convexity are efficiently solvable (Q4554573) (← links)
