  Recently, a conjecture due to Hendry was disproved which stated that every
Hamiltonian chordal graph is cycle extendible. Here we further explore the
conjecture, showing that it fails to hold even when a number of extra
conditions are imposed. In particular, we show that Hendry's Conjecture fails
for strongly chordal graphs, graphs with high connectivity, and if we relax the
definition of "cycle extendible" considerably. We also consider the original
conjecture from a subtree intersection model point of view, showing that a
result of Abuieda et al is nearly best possible.
