On cliques and forcing m-convexity numbers of graphs.

zbMATH Open1265.05331MaRDI QIDQ4897489FDOQ4897489

Authors: Napoleon A. Jun. Gaquing, S. R. Canoy 

Publication date: 19 December 2012

Recommendations

• scientific article; zbMATH DE number 5139517
• The Forcing Convexity Number of a Graph
• Some remarks on the convexity number of a graph
• A note on the forcing convexity number of graphs
• Convex domination in the composition and Cartesian product of graphs.

zbMATH Keywords

graph\(m\)-convex setforcing clique number\(m\)-forcing convexity number\(m\)-forcing subsetforcing \(c\)-subset

Mathematics Subject Classification ID

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

Cited In (2)

• The Forcing Convexity Number of a Graph
• Title not available (Why is that?)

This page was built for publication: On cliques and forcing \(m\)-convexity numbers of graphs.

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