Discrete Mathematics & Theoretical Computer Science (Mar 2015)

Extending a perfect matching to a Hamiltonian cycle

Adel Alahmadi,
Robert E. L. Aldred,
Ahmad Alkenani,
Rola Hijazi,
P. Solé,
Carsten Thomassen

Affiliations

Adel Alahmadi: Department of Mathematics [Jeddah]
Robert E. L. Aldred: Department of Mathematics and Statistics [Dunedin]
Ahmad Alkenani: Department of Mathematics [Jeddah]
Rola Hijazi: Department of Mathematics [Jeddah]
P. Solé: Télécom ParisTech
Carsten Thomassen: ORCiD; Department of Applied Mathematics and Computer Science [Lyngby]

DOI: https://doi.org/10.46298/dmtcs.2105
Journal volume & issue: Vol. Vol. 17 no. 1, no. Graph Theory

Abstract

Graph Theory

Published in Discrete Mathematics & Theoretical Computer Science

ISSN: 1462-7264 (Print); 1365-8050 (Online)
Publisher: Discrete Mathematics & Theoretical Computer Science
Country of publisher: France
LCC subjects: Science: Mathematics
Website: https://dmtcs.episciences.org/

About the journal