Diameters of uniform subset graphs
From MaRDI portal
Publication:998410
DOI10.1016/j.disc.2007.11.031zbMath1183.05025OpenAlexW2002267430MaRDI QIDQ998410
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.031
Related Items
On the girth and diameter of generalized Johnson graphs ⋮ Large cycles in generalized Johnson graphs ⋮ Dominating sets for uniform subset graphs ⋮ Orbital diameters of the symmetric and alternating groups
Cites Work
- On the diameter of generalized Kneser graphs
- Hamiltonian uniform subset graphs
- On the spectrum, the growth, and the diameter of a graph
- Circular chromatic number of Kneser graphs
- Triangle-free Hamiltonian Kneser graphs
- The diameter of directed graphs
- Kneser graphs are Hamiltonian for \(n\geq 3k\)
- Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
- The diameter of a scale-free random graph
- The diameter of total domination vertex critical graphs
- On the chromatic number of the square of the Kneser graph \(K(2k+1,k)\)
- On the diameter of Kneser graphs
- Circular chromatic numbers of some reduced Kneser graphs
- Unnamed Item
