Skip to main content
Presentation
Cycle Extendability in Graphs, Bigraphs and Digraphs
42nd Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL
  • LeRoy B. Beasley, Utah State University
  • David E. Brown, Utah State University
  • Brent Thomas
Document Type
Presentation
Publication Date
1-1-2011
Abstract
In 1990, Hendry conjectured that all chordal Hamiltonian graphs are cycle extendable, that is, the vertices of each non-Hamiltonian cycle are contained in a cycle of length one greater. In this talk, we discuss some preliminary results on a generalization of the concept of cycle- extendability to S-extendable; that is, with S ⊆ {1, 2, . . . , n} and G a graph on n vertices, G is S-extendable if the vertices of every non-Hamiltonian cycle are contained in a cycle length i greater, where i ∈ S. We present some results on tournaments, i.e., complete directed graphs, and some observations about cycle-extendability and S-extendability for non-directed graphs.
Citation Information
LeRoy B. Beasley, David E. Brown and Brent Thomas. "Cycle Extendability in Graphs, Bigraphs and Digraphs" 42nd Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL (2011)
Available at: http://works.bepress.com/david_brown2/121/