scientific article; zbMATH DE number 2204179

MaRDI QIDQ5315868zbMATH OpenFDO

Authors Joanna Raczek

Publication date 12 September 2005

zbMATH Keywords

distance

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Convex and isometric domination of (weak) dominating pair graphs
• On the convexity number of graphs
• The convex and weak convex domination number of convex polytopes
• Convex Partitions of Graphs
• Dominating sets for split and bipartite graphs

Cited in

(7)

• On symmetric differences of NP-hard sets with weakly P-selective sets
• Convex and isometric domination of (weak) dominating pair graphs
• On the convexity number of graphs
• On dominating sets whose induced subgraphs have a bounded diameter
• A decidability result for the dominating set problem
• Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs
• The convex and weak convex domination number of convex polytopes

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 Q5315868)