Pages that link to "Item:Q2925422"
From MaRDI portal
The following pages link to Johnson graphs are Hamilton-connected (Q2925422):
Displaying 13 items.
- Liar's dominating sets in graphs (Q335352) (← links)
- Axiomatic characterization of committee scoring rules (Q1729676) (← links)
- Diameter bounds and recursive properties of Full-Flag Johnson graphs (Q1752664) (← links)
- On the automorphism group of doubled Grassmann graphs (Q2024719) (← links)
- \(L(n)\) graphs are vertex-pancyclic and Hamilton-connected (Q2089930) (← links)
- The equidistant dimension of graphs (Q2147613) (← links)
- Johnson graphs are panconnected (Q2274796) (← links)
- On the ensemble of optimal dominating and locating-dominating codes in a graph (Q2346565) (← links)
- Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph (Q2656353) (← links)
- Hamiltonicity of token graphs of fan graphs (Q5198012) (← links)
- Large cycles in generalized Johnson graphs (Q6084722) (← links)
- On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme (Q6124433) (← links)
- Helly-type theorems for the ordering of the vertices of a hypergraph (Q6139863) (← links)
