Dirac’s Type Sufficient Conditions for Hamiltonicity and Pancyclicity
✍ Scribed by Ahmed Ainouche
- Book ID
- 106047777
- Publisher
- Springer Japan
- Year
- 2009
- Tongue
- English
- Weight
- 153 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Bedrossian, P., G. Chen and R.H. &help, A generalization of Fan's condition of Hamiltonicity, pancyclicity, and Hamiltonian connectedness, Discrete Mathematics 115 (1993) 39-50. A weakened version of Fan's condition for Hamiltonicity is shown to be sufficient for a 2-connected graph to be pancyclic
Let G be a 2-connected graph with n vertices and H be an induced subgraph of G. Denote 6 := {u E V(G): d(o) > n/2}. If there exists a pair of vertices x and y at distance 2 in H such that {x, y} c V(H)\K, then H is called degree light. Let F be the unique graph with degree sequence (1, 1,1,3,3,3). I