The Forcing Convexity Number of a Graph

DOI10.1023/A:1013725215238zbMath0995.05044OpenAlexW110075881MaRDI QIDQ3151365

Gary Chartrand, Ping Zhang

Publication date: 15 October 2002

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/30675

zbMATH Keywords

convex setconvexity numberforcing convexity number

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (10)

Extreme Geodesic Graphs ⋮ The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity ⋮ THE FORCING CONVEX DOMINATION NUMBER OF A GRAPH ⋮ The lower and upper forcing geodetic numbers of block--cactus graphs ⋮ The lower and upper forcing geodetic numbers of completen-partite graphs,n-dimensional meshes and tori ⋮ FORCING SUBSETS FOR SOME TYPES OF CONVEX SETS IN A GRAPH ⋮ FORCING SUPER DOMINATION NUMBER OF A GRAPH ⋮ The \((a,b)\)-forcing geodetic graphs ⋮ The forcing hull and forcing geodetic numbers of graphs ⋮ Graphs with large total geodetic number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convexity in graphs
• The convexity number of a graph
• $H$-convex graphs
• A characterization of the interval function of a connected graph

This page was built for publication: The Forcing Convexity Number of a Graph