Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2014.12.008 / rank
Normal rank
 
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.dam.2014.12.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2101150428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not being (super)thin or solid is hard: A study of grid Hamiltonicity / 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: Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets / 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: Q3921269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal labelling of a product of two paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian paths with prescribed edges in 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: Lower bounds on the pathwidth of some grid-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian properties of triangular grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path partitions of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / 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: New lower bound for 2-identifying code in the square grid / 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: The two-equal-disjoint path cover problem of matching composition network / rank
 
Normal rank
Property / cites work
 
Property / cites work: On robust identification in the square and King grids / 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: Q3293867 / 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: 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: Fault-Hamiltonicity of Product Graph of Path and Cycle / 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: Edge-bandwidth of grids and tori / 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: Q4200086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2014.12.008 / rank
 
Normal rank

Latest revision as of 02:18, 18 December 2024

scientific article
Language Label Description Also known as
English
Many-to-many two-disjoint path covers in cylindrical and toroidal grids
scientific article

    Statements

    Many-to-many two-disjoint path covers in cylindrical and toroidal grids (English)
    0 references
    0 references
    0 references
    28 April 2015
    0 references
    disjoint path
    0 references
    path cover
    0 references
    path partition
    0 references
    square grid
    0 references
    lattice graph
    0 references
    cylindrical grid
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers