Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\) (Q2032752): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2021.112430
@@ Property / DOI: 10.1016/j.disc.2021.112430 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2021.112430
+Normal rank
@@ Property / OpenAlex ID @@
+W3157121578
@@ Property / OpenAlex ID: W3157121578 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4063504
@@ Property / cites work: Q4063504 / rank @@
+Normal rank
@@ Property / cites work @@
+Kneser graphs are Hamiltonian for \(n\geq 3k\)
@@ Property / cites work: Kneser graphs are Hamiltonian for \(n\geq 3k\) / rank @@
+Normal rank
@@ Property / cites work @@
+Triangle-free Hamiltonian Kneser graphs
@@ Property / cites work: Triangle-free Hamiltonian Kneser graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian Kneser graphs
@@ Property / cites work: Hamiltonian Kneser graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Distance-2 Cyclic Chaining of Constant-Weight Codes
+Normal rank
@@ Property / cites work @@
+Q3932310
@@ Property / cites work: Q3932310 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2021.112430
@@ Property / DOI: 10.1016/J.DISC.2021.112430 / rank @@
+Normal rank