A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490): Difference between revisions

@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
+Normal rank
@@ Property / cites work @@
+Linear-Time Algorithms for Tree Root Problems
@@ Property / cites work: Linear-Time Algorithms for Tree Root Problems / 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 @@
+Hamiltonian paths with prescribed edges in hypercubes
+Normal rank
@@ Property / cites work @@
+Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
+Normal rank
@@ Property / cites work @@
+Characterization of n-path graphs and of graphs having \(n\)-th root
+Normal rank
@@ Property / cites work @@
+The square of every two-connected graph is Hamiltonian
+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 @@
+Paired many-to-many disjoint path covers in faulty hypercubes
+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 @@
+Tree Powers
@@ Property / cites work: Tree Powers / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
+Normal rank
@@ Property / cites work @@
+Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$
+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 @@
+Q5501358
@@ Property / cites work: Q5501358 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing Powers of Proper Interval, Split, and Chordal Graphs
+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 @@
+Algorithms for Square Roots of Graphs
@@ Property / cites work: Algorithms for Square Roots of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of line graphs that are squares of graphs
+Normal rank
@@ Property / cites work @@
+Computing square roots of trivially perfect and threshold graphs
+Normal rank
@@ Property / cites work @@
+Computing roots of graphs is hard
@@ Property / cites work: Computing roots of graphs is hard / rank @@
+Normal rank
@@ Property / cites work @@
+The square root of a graph
@@ Property / cites work: The square root of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A short proof of the versatile version of Fleischner's theorem
+Normal rank
@@ Property / cites work @@
+Hamiltonian properties of the cube of a 2-edge connected graph
+Normal rank
@@ Property / cites work @@
+Single-source three-disjoint path covers in cubes of connected graphs
+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 two-disjoint path covers in cylindrical and toroidal grids
+Normal rank
@@ Property / cites work @@
+Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
+Normal rank
@@ Property / cites work @@
+Q4166782
@@ Property / cites work: Q4166782 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5728984
@@ Property / cites work: Q5728984 / rank @@
+Normal rank