scientific article; zbMATH DE number 6390842

MaRDI QIDQ2940127zbMATH OpenFDO

Authors Julie R. Carrington, Robert Brigham, Richard P. Vitray, Mark Anderson, Ronald D. Dutton

Publication date 26 January 2015

zbMATH Keywords

dominationedge protectioneternalgraph characterizationtotal dominationtotal vertex cover

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Computational complexity of covering three-vertex multigraphs
• Computational complexity of covering three-vertex multigraphs
• A note on vertex cover in graphs with maximum degree 3
• On the vertex cover number of 3-uniform hypergraph
• The vertex cover \(P_3\) problem in cubic graphs
• Graphs with a 3-cycle-2-cover
• Coverability of graph by three odd subgraphs
• Publication:4493343
• Three ways to cover a graph
• An exact result for 3-graphs

Cited in

(8)

• On graphs whose eternal vertex cover number and vertex cover number coincide
• A substructure based lower bound for eternal vertex cover number
• scientific article; zbMATH DE number 4137790 (Why is no real title available?)
• Coverability of graph by three odd subgraphs
• A new lower bound for the eternal vertex cover number of graphs
• Computing eternal vertex cover number of maximal outerplanar graphs in linear time
• (Eternal) vertex cover numbers of infinite and finite grid graphs
• Three ways to cover a graph

This page was built for publication:

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