Dominating vertex covers: the vertex-edge domination problem

DOI10.7151/dmgt.2175zbMath1464.05293OpenAlexW2898784090WikidataQ129022165 ScholiaQ129022165MaRDI QIDQ2214311

Margaret-Ellen Messinger, Anders Yeo, William F. Klostermeyer

Publication date: 8 December 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2175

zbMATH Keywords

cubic graphsdominating setvertex coververtex-edge dominating set

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Vertex cover and Edge vertex domination in trees ⋮ Vertex-edge domination in cubic graphs

Cites Work

• Transversals in 4-uniform hypergraphs
• An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs
• The searchlight problem for road networks
• Bounds on the vertex-edge domination number of a tree
• A new bound on the domination number of connected cubic graphs
• Protecting a graph with mobile guards
• Vertex-edge domination in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Dominating vertex covers: the vertex-edge domination problem