Pages that link to "Item:Q1313728"
From MaRDI portal
The following pages link to Efficient edge domination problems in graphs (Q1313728):
Displayed 7 items.
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- Efficient edge domination in regular graphs (Q1005253) (← links)
- Solving the weighted efficient edge domination problem on bipartite permutation graphs (Q1270782) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Maximum \(k\)-regular induced subgraphs (Q2426653) (← links)
- Dominating Induced Matchings (Q3655141) (← links)
- THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS (Q4820130) (← links)