Some remarks on the convexity number of a graph

DOI10.1007/s00373-002-0518-4zbMath1023.05079OpenAlexW1964913179MaRDI QIDQ1411111

John G. Gimbel

Publication date: 16 October 2003

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-002-0518-4

zbMATH Keywords

Ramsey theoryclique number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Related Items (12)

A necessary condition for the equality of the clique number and the convexity number of a graph ⋮ Geodetic Convexity Parameters for Graphs with Few Short Induced Paths ⋮ A general framework for path convexities ⋮ Computing the hull number in toll convexity ⋮ A note on the convexity number of the complementary prisms of trees ⋮ The strong convexity spectra of grids ⋮ On the convexity number of graphs ⋮ Convex Partitions of Graphs ⋮ Algorithmic Aspects of Monophonic Convexity ⋮ Complexity results related to monophonic convexity ⋮ Geodetic convexity parameters for \((q, q - 4)\)-graphs ⋮ On the Convexity of Paths of Length Two in Undirected Graphs

This page was built for publication: Some remarks on the convexity number of a graph