Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240)

From MaRDI portal
Revision as of 20:05, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
scientific article

    Statements

    Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (English)
    0 references
    0 references
    0 references
    0 references
    23 September 2015
    0 references
    0 references
    disjoint path
    0 references
    strongly Hamiltonian-laceable
    0 references
    Hamiltonian path
    0 references
    bipartite HL-graph
    0 references
    fault tolerance
    0 references
    0 references
    0 references
    0 references