Families of Graph-different Hamilton Paths

DOI10.1137/110837814zbMath1246.05160arXiv1106.3754OpenAlexW1985859876MaRDI QIDQ2902904

Silvia Messuti, Gábor Simonyi, János Körner

Publication date: 22 August 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.3754

zbMATH Keywords

Shannon capacityHamilton pathsintersection problemsgraph-difference

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62) Coding theorems (Shannon theory) (94A24) Extremal combinatorics (05D99)

Related Items (7)

Structured Codes of Graphs ⋮ \(K_4\)-intersecting families of graphs ⋮ New bounds on even cycle creating Hamiltonian paths using expander graphs ⋮ Connector families of graphs ⋮ Triangle-different Hamiltonian paths ⋮ On $k$-Neighbor Separated Permutations ⋮ Path Separation by Short Cycles

This page was built for publication: Families of Graph-different Hamilton Paths