Single-source three-disjoint path covers in cubes of connected graphs (Q2444763): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2013.04.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2118864569
@@ Property / OpenAlex ID: W2118864569 / rank @@
+Normal rank
@@ Property / cites work @@
+Induced \(S(K_{1,3})\) and hamiltonian cycles in the square of a graph
+Normal rank
@@ Property / cites work @@
+The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+The square of a block is Hamiltonian connected
@@ Property / cites work: The square of a block is Hamiltonian connected / rank @@
+Normal rank
@@ Property / cites work @@
+The cube of every connected graph is 1-hamiltonian
+Normal rank
@@ Property / cites work @@
+Many-to-many disjoint paths in faulty hypercubes
@@ Property / cites work: Many-to-many disjoint paths in faulty hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+On graphs whose square have strong Hamiltonian properties
+Normal rank
@@ Property / cites work @@
+Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
+Normal rank
@@ Property / cites work @@
+Hamiltonian cycles in the square of a graph
@@ Property / cites work: Hamiltonian cycles in the square of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+The square of every two-connected graph is Hamiltonian
+Normal rank
@@ Property / cites work @@
+In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
+Normal rank
@@ Property / cites work @@
+A short proof of Fleischner's theorem
@@ Property / cites work: A short proof of Fleischner's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Path partitions of hypercubes
@@ Property / cites work: Path partitions of hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+Trees with Hamiltonian square
@@ Property / cites work: Trees with Hamiltonian square / rank @@
+Normal rank
@@ Property / cites work @@
+On the Cube of a Graph
@@ Property / cites work: On the Cube of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
+Normal rank
@@ Property / cites work @@
+The 2-hamiltonian cubes of graphs
@@ Property / cites work: The 2-hamiltonian cubes of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with 1-hamiltonian-connected cubes
@@ Property / cites work: Graphs with 1-hamiltonian-connected cubes / rank @@
+Normal rank
@@ Property / cites work @@
+On Path Cover Problems in Digraphs and Applications to Program Testing
+Normal rank
@@ Property / cites work @@
+Hamiltonian properties of the cube of a 2-edge connected graph
+Normal rank
@@ Property / cites work @@
+Disjoint path covers in cubes of connected graphs
@@ Property / cites work: Disjoint path covers in cubes of connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
+Normal rank
@@ Property / cites work @@
+Hamiltonian Paths in the Square of a Tree
@@ Property / cites work: Hamiltonian Paths in the Square of a Tree / rank @@
+Normal rank
@@ Property / cites work @@
+Q4166782
@@ Property / cites work: Q4166782 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5728984
@@ Property / cites work: Q5728984 / rank @@
+Normal rank