A necessary condition for the equality of the clique number and the convexity number of a graph

DOI10.1016/J.DAM.2022.02.021MaRDI QIDQ2127622zbMATH OpenOpenAlexFDO

Authors Marina Moscarini

Publication date 20 April 2022

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2022.02.021

zbMATH Keywords

chordal graphsclique numberconvexity numberdistance-hereditary graphsgeodesic convexitymonophonic convexity

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) General convexity (52A99)

Recommendations

• The convexity number of a graph
• scientific article; zbMATH DE number 1743966
• Some remarks on the convexity number of a graph
• Convex sets under some graph operations
• scientific article; zbMATH DE number 1439489

Cites work

• Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent
• Complexity results related to monophonic convexity
• Convex sets in graphs. II: Minimal path convexity
• Convexity in Graphs and Hypergraphs
• scientific article; zbMATH DE number 1064241 (Why is no real title available?)
• Inapproximability results related to monophonic convexity
• On rigid circuit graphs
• On the convexity number of graphs
• On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent
• Optimal decomposition by clique separators
• Some remarks on the convexity number of a graph
• The convexity number of a graph
• The maximum infection time in the geodesic and monophonic convexities
• Two classes of graphs in which some problems related to convexity are efficiently solvable

Cited in

(1)

• scientific article; zbMATH DE number 1743966 (Why is no real title available?)

This page was built for publication: A necessary condition for the equality of the clique number and the convexity number of a graph

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