The following pages link to Double vertex-edge domination (Q5370818):
Displaying 12 items.
- An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs (Q1743482) (← links)
- Double vertex-edge domination in graphs: complexity and algorithms (Q2053214) (← links)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q2111523) (← links)
- Results on vertex-edge and independent vertex-edge domination (Q2168729) (← links)
- Vertex-edge domination in cubic graphs (Q2198396) (← links)
- (Q5037236) (← links)
- Total vertex-edge domination in graphs: Complexity and algorithms (Q5057738) (← links)
- On the double total dominator chromatic number of graphs (Q5101880) (← links)
- Vertex-edge domination in unit disk graphs (Q5918769) (← links)
- Vertex-edge domination in graphs (Q5919557) (← links)
- Edge-vertex domination in trees (Q6115749) (← links)
- Total outer connected vertex-edge domination (Q6174136) (← links)
