2-(edge-)connected edge domination number and matching number
From MaRDI portal
Publication:2698534
Recommendations
Cites work
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- scientific article; zbMATH DE number 3674114 (Why is no real title available?)
- scientific article; zbMATH DE number 3702724 (Why is no real title available?)
- scientific article; zbMATH DE number 2209525 (Why is no real title available?)
- 2-edge connected dominating sets and 2-connected dominating sets of a graph
- Approximation algorithms for NP-complete problems on planar graphs
- Connected edge domination in graphs
- Edge Dominating Sets in Graphs
- Graph theory
- Maximum matching and kernelization of edge dominating set
- On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
- Smallest maximal matchings in the graph of the d-dimensional cube
- The nm-domination number of a graph
Cited in
(2)
This page was built for publication: 2-(edge-)connected edge domination number and matching number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698534)