Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs

DOI10.1016/j.ins.2013.04.013zbMath1337.68210OpenAlexW2064889681MaRDI QIDQ497240

Shinhaeng Jo, Jung-Heum Park, Kyung-Yong Chwa

Publication date: 23 September 2015

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.04.013

zbMATH Keywords

fault toleranceHamiltonian pathdisjoint pathbipartite HL-graphstrongly Hamiltonian-laceable

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (16)

Algorithms for finding disjoint path covers in unit interval graphs ⋮ Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ Paired many-to-many disjoint path covers in faulty hypercubes ⋮ A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs ⋮ Paired 2-disjoint path covers of multidimensional torus networks with faulty edges ⋮ Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes ⋮ Ore-type degree conditions for disjoint path covers in simple graphs ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ Odd cycles embedding on folded hypercubes with conditional faulty edges ⋮ Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes ⋮ Paired many-to-many disjoint path covers of hypertori ⋮ The bicube: an interconnection of two hypercubes ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids ⋮ The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks

Cites Work

• Unnamed Item
• Unnamed Item
• On shortest disjoint paths in planar graphs
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• Long paths and cycles in hypercubes with faulty vertices
• Many-to-many disjoint paths in faulty hypercubes
• Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
• Longest fault-free paths in hypercubes with vertex faults
• The two-equal-disjoint path cover problem of matching composition network
• Path partitions of hypercubes
• On the spanning connectivity and spanning laceability of hypercube-like networks
• Long paths in hypercubes with conditional node-faults
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
• Hamiltonian paths with prescribed edges in hypercubes
• Hamiltonian properties on the class of hypercube-like networks
• Paired many-to-many disjoint path covers of the hypercubes
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• On Path Cover Problems in Digraphs and Applications to Program Testing
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• The bicube: an interconnection of two hypercubes
• Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$

This page was built for publication: Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs