Triangle-different Hamiltonian paths

DOI10.1016/j.jctb.2017.09.003zbMath1379.05070arXiv1608.05237OpenAlexW2963844734MaRDI QIDQ684117

Juan-Miguel Gracia

Publication date: 9 February 2018

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

permutationsextremal combinatoricsgraph different Hamiltonian pathsShannon capacity of graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Structured Codes of Graphs ⋮ New bounds on even cycle creating Hamiltonian paths using expander graphs ⋮ On $k$-Neighbor Separated Permutations

Cites Work

• Connector families of graphs
• On types of growth for graph-different permutations
• On the maximum number of permutations with given maximal or minimal distance
• Triangle-intersecting families of graphs
• Degree-Doubling Graph Families
• Families of Graph-different Hamilton Paths
• Graph-Different Permutations
• Path Separation by Short Cycles
• Permutation Capacities of Families of Oriented Infinite Paths
• Pairwise colliding permutations and the capacity of infinite graphs
• Intersecting families of permutations

This page was built for publication: Triangle-different Hamiltonian paths