| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8941799 | Discrete Applied Mathematics | 2018 | 6 Pages |
Abstract
Let G=(VG,EG) be a connected graph with n vertices. We show that if Ï2(G)â¥23n and G is K1,4-free (i.e. without induced K1,4), then G contains a Hamiltonian path.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Benjamin Momège,