Two Hamilton paths in Kn are separated by a cycle of length k if their union contains such a cycle. For K = 4 we bound the asymptotics of the maximum cardinality of a family of Hamilton paths in Kn such that any pair of paths in the family is separated by a cycle of length k. We also deal with related problems, including directed Hamilton paths. © 2016 Wiley Periodicals, Inc.
Path separation by short cycles / Cohen, Gérard; Fachini, Emanuela; Korner, Janos. - In: JOURNAL OF GRAPH THEORY. - ISSN 0364-9024. - 85:1(2017), pp. 107-114. [10.1002/jgt.22050]
Path separation by short cycles
FACHINI, Emanuela;KORNER, JANOS
2017
Abstract
Two Hamilton paths in Kn are separated by a cycle of length k if their union contains such a cycle. For K = 4 we bound the asymptotics of the maximum cardinality of a family of Hamilton paths in Kn such that any pair of paths in the family is separated by a cycle of length k. We also deal with related problems, including directed Hamilton paths. © 2016 Wiley Periodicals, Inc.File allegati a questo prodotto
File | Dimensione | Formato | |
---|---|---|---|
Cohen_Path_2017.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
83.28 kB
Formato
Adobe PDF
|
83.28 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.