Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125): Difference between revisions

@@ Property / cites work @@
+Linear algorithm for optimal path cover problem on interval graphs
+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 @@
+Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Paired many-to-many disjoint path covers of the hypercubes
+Normal rank
@@ Property / cites work @@
+Paths in interval graphs and circular arc graphs
@@ Property / cites work: Paths in interval graphs and circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4301919
@@ Property / cites work: Q4301919 / rank @@
+Normal rank
@@ Property / cites work @@
+-tough cocomparability graphs are hamiltonian
@@ Property / cites work: 1-tough cocomparability graphs are hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A Characterization of Comparability Graphs and of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
+Normal rank
@@ Property / cites work @@
+Paired many-to-many disjoint path covers in faulty hypercubes
+Normal rank
@@ Property / cites work @@
+On a class of posets and the corresponding comparability graphs
+Normal rank
@@ Property / cites work @@
+Finding Hamiltonian circuits in interval graphs
@@ Property / cites work: Finding Hamiltonian circuits in interval graphs / 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 @@
+General-demand disjoint path covers in a graph with faulty elements
+Normal rank
@@ Property / cites work @@
+Q2827796
@@ Property / cites work: Q2827796 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs
+Normal rank
@@ Property / cites work @@
+Ore-type degree conditions for disjoint path covers in simple graphs
+Normal rank
@@ Property / cites work @@
+On Path Cover Problems in Digraphs and Applications to Program Testing
+Normal rank
@@ Property / cites work @@
+Algorithms for finding disjoint path covers in unit interval graphs
+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 @@
+Scattering number in graphs
@@ Property / cites work: Scattering number in graphs / rank @@
+Normal rank