On total vertex covers and edge domination in graphs

MaRDI QIDQ4604341zbMATH OpenFDO

Authors William F. Klostermeyer, A. Yeo

Publication date 23 February 2018

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)

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

Cited in

(4)

• Properties of vertex cover obstructions
• On complexity of total vertex cover on subcubic graphs
• 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)