Many-to-many two-disjoint path covers in restricted hypercube-like graphs (Q2441778)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Many-to-many two-disjoint path covers in restricted hypercube-like graphs
scientific article

    Statements

    Many-to-many two-disjoint path covers in restricted hypercube-like graphs (English)
    0 references
    0 references
    0 references
    28 March 2014
    0 references
    disjoint path cover
    0 references
    hypercube-like graph
    0 references
    Hamiltonian path
    0 references
    Hamiltonian cycle
    0 references
    RHL graph
    0 references
    fault tolerance
    0 references
    interconnection network
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references