Hamiltonian Kneser graphs
From MaRDI portal
Recommendations
Cited in
(29)- Hamiltonian uniform subset graphs
- Hamiltonian threshold graphs
- Two Hamilton cycles in bipartite reflective Kneser graphs
- Long induced paths and cycles in Kneser graphs
- Triangle-free Hamiltonian Kneser graphs
- Hamiltonicity, minimum degree and leaf number
- Kneser graphs are Hamiltonian for \(n\geq 3k\)
- Binomial and q-binomial coefficient inequalities related to the hamiltonicity of the Kneser graphs and their q-analogues
- Short proof that Kneser graphs are Hamiltonian for n 4k
- Hamiltonian character graphs
- Hamiltonian graphs from Kirkman to König
- Kneser representations of graphs
- Sperner type theorems with excluded subposets
- Hamiltonian ?-factors in graphs
- scientific article; zbMATH DE number 2059939 (Why is no real title available?)
- Arrangements of \(k\)-sets with intersection constraints
- Sparse Kneser graphs are Hamiltonian
- Sparse Kneser graphs are Hamiltonian
- Bipartite Kneser graphs are Hamiltonian
- Bipartite Kneser graphs are Hamiltonian
- A minimum-change version of the Chung-Feller theorem for Dyck paths
- An inductive construction for Hamilton cycles in Kneser graphs
- Kneser graphs are Hamiltonian
- Some locally Kneser graphs
- A note on P_k-decomposition of the Kneser graph
- Hamiltonicity of Schrijver graphs and stable Kneser graphs
- Four cycle decomposition of K(n, 2)
- Kneser graphs are Hamiltonian (extended abstract)
- Kneser graphs are Hamiltonian
This page was built for publication: Hamiltonian Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603265)
