Pages that link to "Item:Q2928582"
From MaRDI portal
The following pages link to Complexity aspects of the computation of the rank of a graph (Q2928582):
Displaying 7 items.
- And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
- Characterization and recognition of Radon-independent sets in split graphs (Q1941699) (← links)
- On the geodetic rank of a graph (Q2364865) (← links)
- Convex Independence in Permutation Graphs (Q2958358) (← links)
- On the monophonic rank of a graph (Q6045452) (← links)
- Open packing in \(H\)-free graphs and subclasses of split graphs (Q6547836) (← links)
- Edge open packing: complexity, algorithmic aspects, and bounds (Q6646442) (← links)