Chord theorems on graphs
From MaRDI portal
Abstract: The Horizontal Chord Theorem states that if a continuous curve connects points and in the plane, then for any integer there are points and on the curve such that . In this note, we discuss a few combinatorial-analysis problems related to this theorem and introduce a different formulation that gives way to generalizations on graphs.
Recommendations
- On the chordality of a graph
- scientific article; zbMATH DE number 1533810
- A generalization of chordal graphs
- Chordal graphs
- scientific article; zbMATH DE number 4043881
- scientific article; zbMATH DE number 2042724
- scientific article; zbMATH DE number 4077265
- scientific article; zbMATH DE number 742642
- A Separator Theorem for Chordal Graphs
- An inequality characterizing chordal graphs
Cites work
Cited in
(10)- The square of a chordal graph
- On the chord set of continuous functions
- The chords theorem recalled to life at the turn of the eighteenth century
- Uniformity of direct unions of Chord
- ON THE STRENGTH OF TWO RECURRENCE THEOREMS
- Computing Domains of Attraction for Planar Dynamics
- scientific article; zbMATH DE number 647266 (Why is no real title available?)
- scientific article; zbMATH DE number 2042724 (Why is no real title available?)
- scientific article; zbMATH DE number 1533810 (Why is no real title available?)
- Computational unsolvability of domains of attraction of nonlinear systems
This page was built for publication: Chord theorems on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605007)