A degree condition implying that every matching is contained in a Hamiltonian cycle
type: Item
instance of: scholarly article
title: A degree condition implying that every matching is contained in a Hamiltonian cycle
zbMATH Open document ID: 1214.05111
author: Denise Amar
author: Grzegorz Gancarzewicz
author: Evelyne Flandrin
published in: Discrete Mathematics
publication date: 2009-06-19T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5566763
zbMATH Keywords: cycle
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: matching
MaRDI profile type: Publication
full work available at URL: j.disc.2008.02.003
OpenAlex ID: W1969871488
cites work: Proof of a conjecture of Haeggkvist on cycles and independent edges
cites work: A method in graph theory
cites work: Q3912829
cites work: Cycles containing matchings and pairwise compatible euler tours
cites work: Note on Hamilton Circuits
cites work: HAMILTONIAN CYCLES THROUGH MATCHINGS
DOI: 10.1016/J.DISC.2008.02.003
description: scientific article; zbMATH DE number 5566763