Pages that link to "Item:Q2275456"
From MaRDI portal
The following pages link to Partitioning a graph into convex sets (Q2275456):
Displaying 12 items.
- Geodeticity of the contour of chordal bipartite graphs (Q324794) (← links)
- Convex \(p\)-partitions of bipartite graphs (Q897926) (← links)
- On the contour of bipartite graphs (Q1752491) (← links)
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584) (← links)
- The geodesic classification problem on graphs (Q2132333) (← links)
- Strong geodetic cores and Cartesian product graphs (Q2286132) (← links)
- Covering graphs with convex sets and partitioning graphs into convex sets (Q2308465) (← links)
- On the spectrum and number of convex sets in graphs (Q2339431) (← links)
- On finding convex cuts in general, bipartite and plane graphs (Q2402674) (← links)
- On the contour of graphs (Q2446313) (← links)
- Maximal closed set and half-space separations in finite closure systems (Q6093588) (← links)
- Efficient realizations of closure systems (Q6193266) (← links)
