Johnson graphs are Hamilton-connected

DOI10.26493/1855-3974.291.574MaRDI QIDQ2925422zbMATH OpenOpenAlexWikidataFDO

Authors 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

Hamilton pathHamilton-connectedJohnson graph

Mathematics Subject Classification ID

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

Cited in

(16)

• Axiomatic characterization of committee scoring rules
• Diameter bounds and recursive properties of Full-Flag Johnson graphs
• On the automorphism group of doubled Grassmann graphs
• \(L(n)\) graphs are vertex-pancyclic and Hamilton-connected
• The equidistant dimension of graphs
• Johnson graphs are panconnected
• On the ensemble of optimal dominating and locating-dominating codes in a graph
• Small cycles, generalized prisms and Hamiltonian cycles in the bubble-sort graph
• Liar's dominating sets in graphs
• Hamiltonicity of token graphs of fan graphs
• 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
• Nonuniform subset graphs associated with any graph
• On the distance transitivity of the bipartite Kneser graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2925422)