Edge dominating sets and vertex covers
DOI10.7151/DMGT.1681zbMATH Open1300.05217OpenAlexW2099602827MaRDI QIDQ2860871FDOQ2860871
Authors: William F. Klostermeyer, Ronald D. Dutton 
Publication date: 11 November 2013
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1681
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (7)
- A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
- Vertex cover and edge-vertex domination in trees
- Edge dominating set and colorings on graphs with fixed clique-width
- Edge domination in some path and cycle related graphs
- Strong and weak edges of a graph and linkages with the vertex cover problem
- Title not available (Why is that?)
- Dominating vertex covers: the vertex-edge domination problem
This page was built for publication: Edge dominating sets and vertex covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2860871)
