Existence of a P₂ k + 1-decomposition in the Kneser graph K G_t, 2
From MaRDI portal
Publication:1752691
Recommendations
Cites work
- A combinatorical proof of Kneser's conjecture
- A New Short Proof of Kneser's Conjecture
- A short proof of Kneser's conjecture
- A textbook of graph theory
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- Decomposition of the Kneser graph into paths of length four
- scientific article; zbMATH DE number 2059939 (Why is no real title available?)
- Kneser graphs are Hamiltonian for \(n\geq 3k\)
- Kneser's conjecture, chromatic number, and homotopy
- Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
- Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
- Path decompositions of Kneser and generalized Kneser graphs
Cited in
(5)
This page was built for publication: Existence of a \(P_{2 k + 1}\)-decomposition in the Kneser graph \(K G_{t, 2}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752691)