Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (Q991753): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning multi-paths in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many disjoint paths in faulty hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices / 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: Perfect matchings extend to Hamilton cycles in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path partitions of hypercubes / 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: The two-equal-disjoint path cover problem of matching composition network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey on path and cycle embedding in some networks / rank
 
Normal rank

Latest revision as of 04:40, 3 July 2024

scientific article
Language Label Description Also known as
English
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
scientific article

    Statements

    Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (English)
    0 references
    0 references
    7 September 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    hypercube
    0 references
    vertex-disjoint paths
    0 references
    Hamiltonian path
    0 references
    matching
    0 references
    folded hypercube
    0 references
    interconnection network
    0 references
    0 references