Johnson graphs are Hamilton-connected

DOI10.26493/1855-3974.291.574zbMath1301.05202OpenAlexW2104300781WikidataQ129355055 ScholiaQ129355055MaRDI QIDQ2925422

Brian Alspach

Publication date: 22 October 2014

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.291.574

zbMATH Keywords

Johnson graphHamilton pathHamilton-connected

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

The equidistant dimension of graphs ⋮ Liar's dominating sets in graphs ⋮ Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph ⋮ Large cycles in generalized Johnson graphs ⋮ On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme ⋮ Helly-type theorems for the ordering of the vertices of a hypergraph ⋮ Dominating sets for uniform subset graphs ⋮ Axiomatic characterization of committee scoring rules ⋮ Diameter bounds and recursive properties of Full-Flag Johnson graphs ⋮ Johnson graphs are panconnected ⋮ On the automorphism group of doubled Grassmann graphs ⋮ Hamiltonicity of token graphs of fan graphs ⋮ \(L(n)\) graphs are vertex-pancyclic and Hamilton-connected ⋮ On the ensemble of optimal dominating and locating-dominating codes in a graph

This page was built for publication: Johnson graphs are Hamilton-connected