A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness

Autor:	Guantao Chen, P. Bedrossian, Richard H. Schelp
Rok vydání:	1993
Předmět:	Combinatorics Discrete mathematics Social connectedness Discrete Mathematics and Combinatorics Graph Mathematics Theoretical Computer Science
Zdroj:	Discrete Mathematics. 115(1-3):39-50
ISSN:	0012-365X
DOI:	10.1016/0012-365x(93)90476-a
Popis:	A weakened version of Fan's condition for Hamiltonicity is shown to be sufficient for a 2-connected graph to be pancyclic (with a few exceptions). Also, a similar condition is shown to be sufficient for a 3-connected graph to be Hamiltonian-connected. These results generalize the earlier work of Benhocine and Wodja (1987).
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::799eab004ed6ef150698d3269fad133b Zobrazit plný text záznamu