The following pages link to Rebuilding convex sets in graphs (Q2566140):
Displaying 26 items.
- The contour of a bridged graph is geodetic (Q266844) (← links)
- On the geodetic iteration number of the contour of a graph (Q277655) (← links)
- On basic chordal graphs and some of its subclasses (Q299101) (← links)
- Geodeticity of the contour of chordal bipartite graphs (Q324794) (← links)
- On the geodeticity of the contour of a graph (Q479045) (← links)
- On the geodetic and the hull numbers in strong product graphs (Q630693) (← links)
- Towards a new framework for domination (Q651449) (← links)
- On geodetic sets formed by boundary vertices (Q819808) (← links)
- Lexicographic product of digraphs and related boundary-type sets (Q831723) (← links)
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs (Q861797) (← links)
- On the geodetic number of median graphs (Q941326) (← links)
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs (Q941349) (← links)
- On the geodetic number and related metric sets in Cartesian product graphs (Q998436) (← links)
- Simplicial powers of graphs (Q1040586) (← links)
- Boundary vertices of Cartesian product of directed graphs (Q1738686) (← links)
- On the contour of bipartite graphs (Q1752491) (← links)
- On the convexity number of graphs (Q1926045) (← links)
- Boundary-type sets in maximal outerplanar graphs (Q2026335) (← links)
- Non-inclusion and other subclasses of chordal graphs (Q2283105) (← links)
- Steiner distance and convexity in graphs (Q2426451) (← links)
- On the contour of graphs (Q2446313) (← links)
- Geodeticity of the contour of chordal graphs (Q2482108) (← links)
- Boundary-type sets of strong product of directed graphs (Q3390054) (← links)
- Some structural, metric and convex properties on the boundary of a graph (Q3439437) (← links)
- Convex Partitions of Graphs (Q3503464) (← links)
- Simplicial Powers of Graphs (Q5505654) (← links)
