On total vertex covers and edge domination in graphs

zbMATH Open1386.05135MaRDI QIDQ4604341FDOQ4604341

Authors: William F. Klostermeyer, A. Yeo 

Publication date: 23 February 2018

Recommendations

• The complexity of total edge domination and some related results on trees
• Total vertex-edge domination in trees
• On the algorithmic complexity of edge total domination
• Total edge-vertex domination
• Total vertex-edge domination

zbMATH Keywords

total dominating setvertex coveredge dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (3)

• Properties of vertex cover obstructions
• Strong and weak edges of a graph and linkages with the vertex cover problem
• Dominating vertex covers: the vertex-edge domination problem

This page was built for publication: On total vertex covers and edge domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604341)