| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652054 | Electronic Notes in Discrete Mathematics | 2013 | 6 Pages |
Abstract
In this paper, we present Dirac-type sufficient conditions for a bipartite graph to possess a Hamiltonian path. We also define a seemingly new family of bipartite graphs, which we call the Z graphs. We show that our sufficient condition can also ensure Hamiltonicity unless the graph is a Z graph.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
