Torus-like graphs and their paired many-to-many disjoint path covers (Q2217462): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2020.09.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3091802786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithm for optimal path cover problem on interval graphs / 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: One-to-one disjoint path covers in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired 2-disjoint path covers of multidimensional torus networks 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: Generalized Gray codes with prescribed ends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest fault-free paths in star graphs with vertex faults / 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: Paired many-to-many disjoint path covers of hypertori / 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: Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2827796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type degree conditions for disjoint path covers in simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003439 / 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: Algorithms for finding disjoint path covers in unit interval 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: An efficient algorithm to construct disjoint path covers of DCell networks / 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 06:00, 24 July 2024

scientific article
Language Label Description Also known as
English
Torus-like graphs and their paired many-to-many disjoint path covers
scientific article

    Statements

    Torus-like graphs and their paired many-to-many disjoint path covers (English)
    0 references
    0 references
    29 December 2020
    0 references
    disjoint path
    0 references
    path cover
    0 references
    path partition
    0 references
    cylindrical grid
    0 references
    torus
    0 references
    0 references
    0 references

    Identifiers