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

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2021.112430 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q114190618 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2021.112430 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3157121578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser graphs are Hamiltonian for \(n\geq 3k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free Hamiltonian Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-2 Cyclic Chaining of Constant-Weight Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932310 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2021.112430 / rank
 
Normal rank

Latest revision as of 20:05, 16 December 2024

scientific article
Language Label Description Also known as
English
Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\)
scientific article

    Statements

    Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\) (English)
    0 references
    0 references
    0 references
    14 June 2021
    0 references
    Kneser graph
    0 references
    Hamiltonian cycle
    0 references

    Identifiers