A Helly theorem for convexity in graphs

DOI10.1016/0012-365X(84)90021-9MaRDI QIDQ799698zbMATH OpenOpenAlexFDO

Authors Robert E. Jamison, R. J. Nowakowski

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(84)90021-9

zbMATH Keywords

clique numberabstract convexityHelly numbergeodesically convex sets

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) Helly-type theorems and geometric transversal theory (52A35)

Recommendations

• Convex sets in a graph
• Intersection theorems for infinite families of convex sets in graphs
• A Radon theorem for Helly graphs
• Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
• Publication:3474669

Cites work

• scientific article; zbMATH DE number 3696004 (Why is no real title available?)
• scientific article; zbMATH DE number 3697163 (Why is no real title available?)
• scientific article; zbMATH DE number 3757213 (Why is no real title available?)
• scientific article; zbMATH DE number 3770461 (Why is no real title available?)
• scientific article; zbMATH DE number 3214278 (Why is no real title available?)
• Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
• Partition numbers for trees and ordered sets
• Some aspects of perfect elimination orderings in chordal graphs
• The edge inducibility of graphs

Cited in

(24)

• Turán theorems and convexity invariants for directed graphs
• Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
• A Helly theorem in weakly modular space
• A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs
• Complexity aspects of the triangle path convexity
• On local convexity in graphs
• Convex sets in a graph
• Graph theory (algorithmic, algebraic, and metric problems)
• A Helly theorem for geodesic convexity in strongly dismantlable graphs
• Complexity results related to monophonic convexity
• Convex sets in graphs. II: Minimal path convexity
• On the minimum sum coloring of P₄-sparse graphs
• On constructible graphs, locally Helly graphs, and convexity
• A Radon theorem for Helly graphs
• Helly and exchange numbers of geodesic and Steiner convexities in lexicographic product of graphs
• Inapproximability results and bounds for the Helly and Radon numbers of a graph
• Some properties of graph centroids
• On the Helly number in \(P_3\)-convexity in graphs
• Convexity in Helly graphs: selection and almost fixed point properties for multifunctions
• Centers of triangulated graphs
• scientific article; zbMATH DE number 3942357 (Why is no real title available?)
• Convexity and fixed-point properties in Helly graphs
• On the Helly property working as a compactness criterion on graphs
• scientific article; zbMATH DE number 4142072 (Why is no real title available?)

This page was built for publication: A Helly theorem for convexity in graphs

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