Document Type
Lecture
Publication Date
2-6-2003
Abstract
An edge e is a chord of a cycle C if E(C) can be partitioned into two sets C1 and C2 such that both C1 e and C2 e are cycles. We characterize all simple graphs such that each edge is a chord of some cycle.
Relational Format
presentation
Recommended Citation
Wu, Haidong, "Chords in Graphs" (2003). Combinatorics Seminar. 118.
https://egrove.olemiss.edu/math_combinatorics/118
COinS
