Pages that link to "Item:Q794174"
From MaRDI portal
The following pages link to Dominating sets for split and bipartite graphs (Q794174):
Displaying 5 items.
- Some new algorithmic results on co-secure domination in graphs (Q6190005) (← links)
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (Q6500104) (← links)
- A closer look at Hamiltonicity and domination through the lens of diameter and convexity (Q6634506) (← links)
- On the computational complexity of the strong geodetic recognition problem (Q6658857) (← links)