Diameters of uniform subset graphs
From MaRDI portal
Publication:998410
DOI10.1016/J.DISC.2007.11.031zbMATH Open1183.05025OpenAlexW2002267430MaRDI QIDQ998410FDOQ998410
Authors: Yongzhu Chen, Weifan Wang
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
Recommendations
Cites Work
- On the diameter of Kneser graphs
- The diameter of a scale-free random graph
- Title not available (Why is that?)
- Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
- Triangle-free Hamiltonian Kneser graphs
- Circular chromatic number of Kneser graphs
- Circular chromatic numbers of some reduced Kneser 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)\)
- The diameter of total domination vertex critical graphs
- The diameter of directed graphs
- On the diameter of generalized Kneser graphs
- On the spectrum, the growth, and the diameter of a graph
Cited In (7)
- 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
- On the diameter of Schrijver 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)