An implicit degree condition for k -connected 2-heavy graphs to be hamiltonian - Laboratoire Interdisciplinaire des Sciences du Numérique Access content directly
Journal Articles Information Processing Letters Year : 2018

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

Hao Li
Junqing Cai
  • Function : Author
  • PersonId : 965038
Yuzhong Zhang
  • Function : Author
No file

Dates and versions

hal-01725869 , version 1 (07-03-2018)

Identifiers

Cite

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⟩
74 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More