Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (Q905847): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2227301424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 1-fixed-endpoint path cover problem is Polynomial on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized twisted cube / 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: Paired many-to-many disjoint path covers of hypercubes with faulty edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired many-to-many disjoint path covers of the 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: Path partitions of hypercubes / 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: Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$ / 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: The two-equal-disjoint path cover problem of matching composition network / rank
 
Normal rank
Property / cites work
 
Property / cites work: General-demand disjoint path covers in a graph with faulty elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-to-one disjoint path covers on multi-dimensional tori / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting structures in the Möbius ladder / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Path Cover Problems in Digraphs and Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive circulants and their embeddings among hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-source three-disjoint path covers in cubes of connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint path covers in cubes of connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many two-disjoint path covers in cylindrical and toroidal grids / 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: One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-to-one disjoint path covers on alternating group graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes / rank
 
Normal rank

Latest revision as of 10:02, 11 July 2024

scientific article
Language Label Description Also known as
English
Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
scientific article

    Statements

    Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (English)
    0 references
    0 references
    28 January 2016
    0 references
    hypercube-like graph
    0 references
    disjoint path
    0 references
    path cover
    0 references
    path partition
    0 references
    fault tolerance
    0 references
    interconnection network
    0 references
    0 references
    0 references

    Identifiers