The convexity number of a graph
From MaRDI portal
Publication:1606022
DOI10.1007/s003730200014zbMath1002.05018OpenAlexW2044108353MaRDI QIDQ1606022
Ping Zhang, Curtiss E. Wall, Gary Chartrand
Publication date: 29 July 2002
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730200014
Related Items
A necessary condition for the equality of the clique number and the convexity number of a graph ⋮ Extreme Geodesic Graphs ⋮ Geodetic Convexity Parameters for Graphs with Few Short Induced Paths ⋮ A note on the convexity number of the complementary prisms of trees ⋮ Unnamed Item ⋮ The strong convexity spectra of grids ⋮ On the convexity number of graphs ⋮ Convex Partitions of Graphs ⋮ THE FORCING CONVEX DOMINATION NUMBER OF A GRAPH ⋮ A lower bound for the convexity number of some graphs ⋮ Graphs with a minimal number of convex sets ⋮ Convexity in oriented graphs ⋮ Geodetic convexity parameters for \((q, q - 4)\)-graphs ⋮ FORCING SUBSETS FOR SOME TYPES OF CONVEX SETS IN A GRAPH ⋮ The Forcing Convexity Number of a Graph
