Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
From MaRDI portal
Publication:1056760
Cites work
- Every planar map is four colorable. I: Discharging
- scientific article; zbMATH DE number 3681783 (Why is no real title available?)
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3459494 (Why is no real title available?)
- scientific article; zbMATH DE number 3486652 (Why is no real title available?)
- scientific article; zbMATH DE number 3508549 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- scientific article; zbMATH DE number 3271295 (Why is no real title available?)
- scientific article; zbMATH DE number 3182580 (Why is no real title available?)
- scientific article; zbMATH DE number 3068278 (Why is no real title available?)
- Some Elementary Properties of Interval Convexities
- Some generalizations of Helly’s theorem on convex sets
- The embeddings of a graph—A survey
- Toward a theory of crossing numbers
- Two Consequences of the Transposition Theorem on Linear Inequalities
- Über eine Übertragung des Hellyschen Satzes in Sphärische Räume
Cited in
(14)- On local convexity in graphs
- Convex sets in graphs. II: Minimal path convexity
- A Helly theorem in weakly modular space
- A Helly theorem for geodesic convexity in strongly dismantlable graphs
- Tverberg numbers for cellular bipartite graphs
- Fixed points in digital topology (via Helly posets)
- Star-shape, Radon number, and minty graphs
- Convexity in Graphs and Hypergraphs
- Graphs with intrinsic s3 convexities
- The colorful Helly theorem and general hypergraphs
- Graph theory (algorithmic, algebraic, and metric problems)
- Graphs with convex balls
- A Helly theorem for convexity in graphs
- Turán theorems and convexity invariants for directed graphs
This page was built for publication: Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1056760)