An optimal embedding of cycles into incomplete hypercubes (Q1607026): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Embedding graphs onto the Supercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding cycles in IEH graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding of cycles in arrangement graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding cycles and meshes onto incomplete hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: EMBEDDINGS OF COMPLETE BINARY TREES INTO EXTENDED GRIDS WITH EDGE-CONGESTION 1∗ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the embedding of cycles in pancake graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of congestion-1 embedding in a hypercube / rank
 
Normal rank

Revision as of 12:04, 4 June 2024

scientific article
Language Label Description Also known as
English
An optimal embedding of cycles into incomplete hypercubes
scientific article

    Statements