Diameters of uniform subset graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 638692 (Why is no real title available?)
- Circular chromatic number of Kneser graphs
- Circular chromatic numbers of some reduced Kneser graphs
- Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
- Hamiltonian uniform subset graphs
- Kneser graphs are Hamiltonian for \(n\geq 3k\)
- On the chromatic number of the square of the Kneser graph \(K(2k+1,k)\)
- On the diameter of Kneser graphs
- On the diameter of generalized Kneser graphs
- On the spectrum, the growth, and the diameter of a graph
- The diameter of a scale-free random graph
- The diameter of directed graphs
- The diameter of total domination vertex critical graphs
- Triangle-free Hamiltonian Kneser graphs
Cited in
(7)- On the diameter of Schrijver graphs
- Large cycles in generalized Johnson graphs
- Kneser graphs are Hamiltonian
- On the girth and diameter of generalized Johnson graphs
- Dominating sets for uniform subset graphs
- Orbital diameters of the symmetric and alternating groups
- On the diameter of generalized Kneser graphs
This page was built for publication: Diameters of uniform subset graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998410)