A Helly theorem for convexity in graphs

DOI10.1016/0012-365X(84)90021-9zbMATH Open0548.05052OpenAlexW2063849229MaRDI QIDQ799698FDOQ799698

R. J. Nowakowski, Robert E. Jamison

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Partition numbers for trees and ordered sets
• Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
• Title not available (Why is that?)
• Some aspects of perfect elimination orderings in chordal graphs
• The edge inducibility of graphs
• Title not available (Why is that?)

Cited In (21)

• Turán theorems and convexity invariants for directed graphs
• Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
• 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
• A Helly theorem in weakly modular space
• 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 constructible graphs, locally Helly graphs, and convexity
• On the minimum sum coloring of \(P_4\)-sparse graphs
• A Radon theorem for Helly graphs
• Inapproximability results and bounds for the Helly and Radon numbers of a graph
• Some properties of graph centroids
• Title not available (Why is that?)
• Convexity and fixed-point properties in Helly graphs
• Centers of triangulated graphs
• On the Helly property working as a compactness criterion on graphs
• Title not available (Why is that?)

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)