Pages that link to "Item:Q5057738"
From MaRDI portal
The following pages link to Total vertex-edge domination in graphs: Complexity and algorithms (Q5057738):
Displaying 8 items.
- An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators (Q1847358) (← links)
- The complexity of total edge domination and some related results on trees (Q2023114) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- Double vertex-edge domination in graphs: complexity and algorithms (Q2053214) (← links)
- Dominating vertex covers: the vertex-edge domination problem (Q2214311) (← links)
- The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems (Q2883612) (← links)
- Vertex-edge domination in graphs (Q5890654) (← links)
- Vertex-edge domination in unit disk graphs (Q5918769) (← links)