Matching graphs of hypercubes and complete bipartite graphs (Q1039435): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hamiltonian Cycles with Prescribed Edges in Hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings extend to Hamilton cycles in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4881930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Combinatorial Gray Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles / rank
 
Normal rank

Latest revision as of 06:15, 2 July 2024

scientific article
Language Label Description Also known as
English
Matching graphs of hypercubes and complete bipartite graphs
scientific article

    Statements

    Identifiers