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

Autor:	Grzegorz Gancarzewicz, Evelyne Flandrin, Denise Amar
Jazyk:	angličtina
Předmět:	Discrete mathematics Combinatorics symbols.namesake Hamiltonian cycle symbols Discrete Mathematics and Combinatorics Quartic graph Matching Cycle Hamiltonian path Graph Theoretical Computer Science Mathematics
Zdroj:	Discrete Mathematics. (11):3703-3713
ISSN:	0012-365X
DOI:	10.1016/j.disc.2008.02.003
Popis:	We 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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a75b3473c3db1cf395561736de1a5b2 Zobrazit plný text záznamu