Bipartite Kneser graphs are Hamiltonian (Q5890906): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3936766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gray codes with restricted density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian uniform subset graphs / 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: An explicit 1-factorization in the middle of the Boolean lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic matchings cannot form Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating the hamiltonian problem—A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized middle-level problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the theory of hypercube graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prism over the middle-levels graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: The antipodal layers problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in the middle two layers of the discrete cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inductive construction for Hamilton cycles in Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit matchings in the middle levels of the Boolean lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rugby footballers of Croam / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Combinatorial Gray Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Gray codes and the middle levels problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4458210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An update on the middle levels problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4305546 / rank
 
Normal rank

Revision as of 17:26, 12 July 2024

scientific article; zbMATH DE number 6639379
Language Label Description Also known as
English
Bipartite Kneser graphs are Hamiltonian
scientific article; zbMATH DE number 6639379

    Statements

    Bipartite Kneser graphs are Hamiltonian (English)
    0 references
    0 references
    0 references
    14 October 2016
    0 references
    Hamilton cycle
    0 references
    Kneser graph
    0 references
    hypercube
    0 references
    vertex-transitive graph
    0 references

    Identifiers