The following pages link to Total vertex-edge domination (Q5028563):
Displaying 16 items.
- 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)
- Dominating vertex covers: the vertex-edge domination problem (Q2214311) (← links)
- Total edge–vertex domination (Q3298121) (← links)
- (Q5021092) (← links)
- Total vertex-edge domination in graphs: Complexity and algorithms (Q5057738) (← links)
- A lower bound on the total vertex-edge domination number of a tree (Q5859501) (← links)
- Vertex-edge domination in graphs (Q5890654) (← links)
- Vertex-edge domination in unit disk graphs (Q5918769) (← links)
- Vertex-edge domination in graphs (Q5919557) (← links)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q6167020) (← links)
- Total outer connected vertex-edge domination (Q6174136) (← links)
- Algorithms and hardness results for edge total domination problem in graphs (Q6199394) (← links)
- Algorithmic aspects of total vertex-edge domination in graphs (Q6629669) (← links)
- Algorithmic study on liar's vertex-edge domination problem (Q6646745) (← links)
