Simple Necessary Conditions for the Existence of a Hamiltonian Path with Applications to Cactus Graphs

09/05/2017
by   Pascal Welke, et al.
0

We describe some necessary conditions for the existence of a Hamiltonian path in any graph (in other words, for a graph to be traceable). These conditions result in a linear time algorithm to decide the Hamiltonian path problem for cactus graphs. We apply this algorithm to several molecular databases to report the numbers of graphs that are traceable cactus graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/17/2018

Hamiltonicity in Convex Bipartite Graphs

For a connected graph, the Hamiltonian cycle (path) is a simple cycle (p...
research
11/16/2019

The Longest (s, t)-paths of O-shaped Supergrid Graphs

In this paper, we continue the study of the Hamiltonian and longest (s, ...
research
05/16/2022

The Hamiltonian Path Graph is Connected for Simple s,t Paths in Rectangular Grid Graphs

A simple s,t path P in a rectangular grid graph 𝔾 is a Hamiltonian path ...
research
04/04/2019

The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs

Supergrid graphs contain grid graphs and triangular grid graphs as their...
research
02/18/2019

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...
research
08/28/2018

Almost Envy-Free Allocations with Connected Bundles

We study the existence of allocations of indivisible goods that are envy...
research
10/07/2021

On Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

We present a quasilinear time algorithm to decide the word problem on a ...

Please sign up or login with your details

Forgot password? Click here to reset