Pages that link to "Item:Q300244"
From MaRDI portal
The following pages link to On the algorithmic complexity of edge total domination (Q300244):
Displaying 10 items.
- Perfect edge domination: hard and solvable cases (Q1639290) (← links)
- Complexity and lowers bounds for power edge set problem (Q1711663) (← links)
- Complexity and inapproximability results for the power edge set problem (Q1743493) (← links)
- An NP-completeness result of edge search in graphs (Q2014718) (← links)
- The complexity of total edge domination and some related results on trees (Q2023114) (← links)
- Complexity and characterization aspects of edge-related domination for graphs (Q2023127) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems (Q2883612) (← links)
- (Q5037236) (← links)
- Algorithms and hardness results for edge total domination problem in graphs (Q6199394) (← links)