Disjoint path covers in cubes of connected graphs
From MaRDI portal
Publication:2449141
DOI10.1016/j.disc.2014.02.010zbMath1288.05145OpenAlexW2142770065MaRDI QIDQ2449141
Publication date: 6 May 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.02.010
Related Items (11)
Algorithms for finding disjoint path covers in unit interval graphs ⋮ Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph ⋮ Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ Ore-type degree conditions for disjoint path covers in simple graphs ⋮ One-to-one disjoint path covers in digraphs ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ Single-source three-disjoint path covers in cubes of connected graphs ⋮ A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A short proof of the versatile version of Fleischner's theorem
- Paired many-to-many disjoint path covers in faulty hypercubes
- Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
- Hamiltonian cycles in the square of a graph
- Many-to-many disjoint paths in faulty hypercubes
- Path partitions of hypercubes
- On graphs whose square have strong Hamiltonian properties
- A short proof of Fleischner's theorem
- In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
- The square of a block is Hamiltonian connected
- Induced \(S(K_{1,3})\) and hamiltonian cycles in the square of a graph
- Hamiltonian paths with prescribed edges in hypercubes
- Single-source three-disjoint path covers in cubes of connected graphs
- Graphs with 1-hamiltonian-connected cubes
- The square of every two-connected graph is Hamiltonian
- Hamiltonian Paths in the Square of a Tree
- Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
- The 2-hamiltonian cubes of graphs
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- Hamiltonian properties of the cube of a 2-edge connected graph
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$
- On the Cube of a Graph
- The cube of every connected graph is 1-hamiltonian
- Trees with Hamiltonian square
This page was built for publication: Disjoint path covers in cubes of connected graphs