One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (Q638511): 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.2011.04.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013976694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings extend to Hamilton cycles in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node‐disjoint paths and related problems on hierarchical cubic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs / 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: Panconnectivity and edge-pancyclicity of<i>k</i>-ary<i>n</i>-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE SPANNING CONNECTIVITY OF THE (n,k)-STAR 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: Cubic planar Hamiltonian graphs of various types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally bi-3*-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint cycles and spanning graphs of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spanning connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spanning connectivity and spanning laceability of hypercube-like networks / 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: Hamilton connected graphs / 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: Cycles embedding in hypercubes with node failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear array and ring embeddings in conditional faulty hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-disjoint paths in hierarchical hypercube networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes / rank
 
Normal rank

Latest revision as of 11:21, 4 July 2024

scientific article
Language Label Description Also known as
English
One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
scientific article

    Statements

    One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (English)
    0 references
    0 references
    0 references
    12 September 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    hypercube
    0 references
    \(k\)-ary \(n\)-cube
    0 references
    Hamiltonian
    0 references
    disjoint path cover
    0 references
    interconnection networks
    0 references
    0 references
    0 references