The following pages link to (Q3059032):
Displaying 27 items.
- On trees with total domination number equal to edge-vertex domination number plus one (Q282302) (← links)
- A note on independent vertex-edge domination in graphs (Q1751226) (← 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)
- Dominating vertex covers: the vertex-edge domination problem (Q2214311) (← links)
- On \(ve\)-degrees and \(ev\)-degrees in graphs (Q2374155) (← links)
- Bounds on the vertex-edge domination number of a tree (Q2450268) (← links)
- Total domination and vertex-edge domination in tres (Q3294995) (← links)
- (Q4582808) (← links)
- Trees with vertex-edge roman domination number twice the domination number minus one (Q5018680) (← links)
- (Q5021092) (← links)
- Total vertex-edge domination (Q5028563) (← links)
- Vertex-Edge Roman Domination (Q5035233) (← links)
- (Q5037236) (← links)
- The outer-connected vertex edge domination number in Cartesian product graphs (Q5043884) (← links)
- (Q5076802) (← links)
- Double vertex-edge domination (Q5370818) (← 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)
- (Q6145871) (← links)
- (Q6155858) (← links)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q6167020) (← links)
- \( M_{v e}\)-polynomial of cog-special graphs and types of fan graphs (Q6169338) (← links)
- Total outer connected vertex-edge domination (Q6174136) (← links)