On hamiltonian cycles in the prism over the odd graphs

Autor:	Peter Horak, Letícia Rodrigues Bueno
Rok vydání:	2010
Předmět:	Combinatorics Discrete mathematics Petersen graph Odd graph Voltage graph Discrete Mathematics and Combinatorics Quartic graph Cubic graph Regular graph Kneser graph Geometry and Topology Pancyclic graph Mathematics
Zdroj:	Journal of Graph Theory. 68:177-188
ISSN:	0364-9024
DOI:	10.1002/jgt.20550
Popis:	The Kneser graph K(n, k) has as its vertex set all k-subsets of an n-set and two k-subsets are adjacent if they are disjoint. The odd graph Ok is a special case of Kneser graph when n = 2k + 1. A long standing conjecture claims that Ok is hamiltonian for all k>2. We show that the prism over Ok is hamiltonian for all k even. © 2010 Wiley Periodicals, Inc. J Graph Theory 68:177-188, 2011 © 2011 Wiley Periodicals, Inc.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::190831775ba05cb2ae791d259076c0f7 https://doi.org/10.1002/jgt.20550 Zobrazit plný text záznamu Plný text