DeepAI AI Chat
Log In Sign Up

Cycle Extendability of Hamiltonian Strongly Chordal Graphs

by   Guozhen Rong, et al.

In 1990, Hendry conjectured that all Hamiltonian chordal graphs are cycle extendable. After a series of papers confirming the conjecture for a number of graph classes, the conjecture is yet refuted by Lafond and Seamone in 2015. Given that their counterexamples are not strongly chordal graphs and they are all only 2-connected, Lafond and Seamone asked the following two questions: (1) Are Hamiltonian strongly chordal graphs cycle extendable? (2) Is there an integer k such that all k-connected Hamiltonian chordal graphs are cycle extendable? Later, a conjecture stronger than Hendry's is proposed. In this paper, we resolve all these questions in the negative. On the positive side, we add to the list of cycle extendable graphs two more graph classes, namely, Hamiltonian 4-leaf powers and Hamiltonian 4-FAN, A-free chordal graphs.


page 1

page 2

page 3

page 4


On Hamiltonian-Connected and Mycielski graphs

A graph G is Hamiltonian-connected if there exists a Hamiltonian path be...

Further results on Hendry's Conjecture

Recently, a conjecture due to Hendry was disproved which stated that eve...

A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals

In this paper, an iterative algorithm is designed to compute the sparse ...

Few hamiltonian cycles in graphs with one or two vertex degrees

We fully disprove a conjecture of Haythorpe on the minimum number of ham...

Fair division of graphs and of tangled cakes

A tangle is a connected topological space constructed by gluing several ...

Feasible bases for a polytope related to the Hamilton cycle problem

We study a certain polytope depending on a graph G and a parameter β∈(0,...

A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in O(log n) Time

It is known for some time that a random graph G(n,p) contains w.h.p. a H...