The following pages link to Hamiltonian uniform subset graphs (Q1071032):
Displaying 17 items.
- General graph pebbling (Q385150) (← links)
- Arrangements of \(k\)-sets with intersection constraints (Q449216) (← links)
- Binary codes and partial permutation decoding sets from the Johnson graphs (Q497331) (← links)
- Diameters of uniform subset graphs (Q998410) (← links)
- Triangle-free Hamiltonian Kneser graphs (Q1410728) (← links)
- The super-connectivity of Kneser graphs (Q1630915) (← links)
- Automorphism groups of graph covers and uniform subset graphs (Q1643909) (← links)
- Diameter bounds and recursive properties of Full-Flag Johnson graphs (Q1752664) (← links)
- Kneser graphs are Hamiltonian for \(n\geq 3k\) (Q1850485) (← links)
- The \(p\)-restricted edge-connectivity of Kneser graphs (Q2008197) (← links)
- Spectrum of Johnson graphs (Q2111919) (← links)
- Binary codes and partial permutation decoding sets from the odd graphs (Q2248512) (← links)
- Codes from the incidence matrices of graphs on 3-sets (Q2275405) (← links)
- A bipartite Erdős-Ko-Rado theorem (Q2366030) (← links)
- On the girth and diameter of generalized Johnson graphs (Q2411607) (← links)
- Sparse Kneser graphs are Hamiltonian (Q5006324) (← links)
- Large cycles in generalized Johnson graphs (Q6084722) (← links)
