descriptionPublicationkeyboard_double_arrow_right Article , Preprint 26 May 2016Embargo end date: 01 Jan 2015 English Publisher:WileyJournal:Journal of Graph Theory, volume 85, pages 107-114 (issn: 0364-9024, eissn: 1097-0118,

Authors: Cohen, Gérard; FACHINI, Emanuela; KORNER, JANOS;

doi: 10.1002/jgt.22050 , 10.48550/arxiv.1501.00813

arXiv: http://arxiv.org/abs/1501.00813

handle: 11573/958419

Path Separation by Short Cycles

- Summary
- Subjects
- Metrics

Abstract

AbstractTwo Hamilton paths in are separated by a cycle of length k if their union contains such a cycle. For we bound the asymptotics of the maximum cardinality of a family of Hamilton paths in 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.

Related Organizations

View all View all

Keywords

FOS: Mathematics, graph-difference; Hamilton paths; permutations; geometry and topology, Mathematics - Combinatorics, Combinatorics (math.CO), 05D99, 05C35, 05C62, 94A24

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	6
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average