An implicit degree condition for k -connected 2-heavy graphs to be hamiltonian

Hao Li (1) , Junqing Cai (2) , Yuzhong Zhang

1 LRI - Laboratoire de Recherche en Informatique
2 Qufu Normal University

Domaines: Mathématique discrète [cs.DM]; Combinatoire [math.CO]

Hao Li, Junqing Cai, Yuzhong Zhang. An implicit degree condition for k -connected 2-heavy graphs to be hamiltonian. Information Processing Letters, 2018, 134, pp.9 - 13. ⟨10.1016/j.ipl.2018.01.010⟩. ⟨hal-01725869⟩