Pages that link to "Item:Q4554573"
From MaRDI portal
The following pages link to Two classes of graphs in which some problems related to convexity are efficiently solvable (Q4554573):
Displaying 3 items.
- On the geodetic iteration number of distance-hereditary graphs (Q898096) (← 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)