DeepAI AI Chat
Log In Sign Up

On Hamiltonian-Connected and Mycielski graphs

by   Ashok Kumar Das, et al.

A graph G is Hamiltonian-connected if there exists a Hamiltonian path between any two vertices of G. It is known that if G is 2-connected then the graph G^2 is Hamiltonian-connected. In this paper we prove that the square of every self-complementary graph of order grater than 4 is Hamiltonian-connected. If G is a k-critical graph, then we prove that the Mycielski graph μ(G) is (k+1)-critical graph. Jarnicki et al.[7] proved that for every Hamiltonian graph of odd order, the Mycielski graph μ(G) of G is Hamiltonian-connected. They also pose a conjecture that if G is Hamiltonian-connected and not K_2 then μ(G) is Hamiltonian-connected. In this paper we also prove this conjecture.


page 1

page 2

page 3

page 4


Cycle Extendability of Hamiltonian Strongly Chordal Graphs

In 1990, Hendry conjectured that all Hamiltonian chordal graphs are cycl...

Are highly connected 1-planar graphs Hamiltonian?

It is well-known that every planar 4-connected graph has a Hamiltonian c...

Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones

We prove that computing a single pair of vertices that are mapped onto e...

Hamiltonian Maker-Breaker games on small graphs

We look at the unbiased Maker-Breaker Hamiltonicity game played on the e...

SFCM-R: A novel algorithm for the hamiltonian sequence problem

A hamiltonian sequence is a path walk P that can be a hamiltonian path o...

Unfolding Orthotubes with a Dual Hamiltonian Path

An orthotube consists of orthogonal boxes (e.g., unit cubes) glued face-...

On the Prevalence of Bridge Graphs Among Non-3-Connected Cubic Non-Hamiltonian Graphs

There is empirical evidence supporting the claim that almost all cubic n...