Paired many-to-many disjoint path covers of hypertori (Q730480): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lee distance and topological properties of k-ary n-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired many-to-many disjoint path covers of hypercubes with faulty edges / 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: 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: Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired many-to-many disjoint path covers in faulty hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many two-disjoint path covers in restricted hypercube-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes / rank
 
Normal rank

Latest revision as of 04:57, 13 July 2024

scientific article
Language Label Description Also known as
English
Paired many-to-many disjoint path covers of hypertori
scientific article

    Statements

    Paired many-to-many disjoint path covers of hypertori (English)
    0 references
    0 references
    0 references
    28 December 2016
    0 references
    disjoint path covers
    0 references
    hypertorus
    0 references
    torus
    0 references
    Flow Free
    0 references

    Identifiers