Locating any two vertices on Hamiltonian cycles in large graphs

Weihua He; Hao Li; Qiang Sun

doi:10.1016/j.disc.2020.111941

Journal Articles Discrete Mathematics Year : 2020

Locating any two vertices on Hamiltonian cycles in large graphs

, (1) ,

1

Weihua He

Function : Author

Hao Li

Function : Author
PersonId : 3220
IdHAL : hao-li
IdRef : 119926911

Laboratoire de Recherche en Informatique

Qiang Sun

Function : Author
PersonId : 762315
ORCID : 0000-0002-6321-4773

Domains

Computer Science [cs] Mathematics [math]

Hao Li : Connect in order to contact the contributor

https://hal.science/hal-03327198

Submitted on : Friday, August 27, 2021-4:20:34 AM

Last modification on : Monday, April 15, 2024-2:41:51 PM

Dates and versions

hal-03327198 , version 1 (27-08-2021)

Identifiers

HAL Id : hal-03327198 , version 1
ARXIV : 1708.00231
DOI : 10.1016/j.disc.2020.111941

Cite

Weihua He, Hao Li, Qiang Sun. Locating any two vertices on Hamiltonian cycles in large graphs. Discrete Mathematics, 2020, 343 (9), pp.111941. ⟨10.1016/j.disc.2020.111941⟩. ⟨hal-03327198⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS UMR8623 CENTRALESUPELEC UNIV-PARIS-SACLAY LISN GS-COMPUTER-SCIENCE GS-LIFE-SCIENCES-HEALTH LISN-GALAC

10 View

0 Download

Locating any two vertices on Hamiltonian cycles in large graphs

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share