Matching graphs of Hypercubes and Complete Bipartite Graphs (Q3503492): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4881930 / 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: Connectivity of Matching Graph of Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Combinatorial Gray Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Cycles with Prescribed Edges in Hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the number of Hamiltonian circuits in the n-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes / rank
 
Normal rank

Latest revision as of 11:21, 28 June 2024

scientific article
Language Label Description Also known as
English
Matching graphs of Hypercubes and Complete Bipartite Graphs
scientific article

    Statements