A degree condition implying that every matching is contained in a hamiltonian cycle

Amar, Denise
Flandrin, Evelyne
Gancarzewicz, Grzegorz

Open PDF

Open link

Publication date

June 2009

DOI

10.1016/j.disc.2008.02.003

Publisher

Elsevier B.V.

ISSN

0012-365X

Citation count (estimate)

Abstract

AbstractWe give a degree sum condition for three independent vertices under which every matching of a graph lies in a hamiltonian cycle. We also show that the bound for the degree sum is almost the best possible

Extracted data

We use cookies to provide a better user experience.

Data Protection

A degree condition implying that every matching is contained in a hamiltonian cycle

Abstract

Extracted data

A degree condition implying that every matching is contained in a hamiltonian cycle

Abstract

Extracted data

Related items

Related items