The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649): Difference between revisions

@@ Property / cites work @@
+Linear algorithm for optimal path cover problem on interval graphs
+Normal rank
@@ Property / cites work @@
+A linear‐time algorithm for the <i>k</i>‐fixed‐endpoint path cover problem on cographs
+Normal rank
@@ Property / cites work @@
+Finding Hamiltonian circuits in proper interval graphs
+Normal rank
@@ Property / cites work @@
+Hamiltonian circuits in interval graph generalizations
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+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 @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs
+Normal rank
@@ Property / cites work @@
+The Hamiltonian problem on distance-hereditary graphs
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
+Normal rank
@@ Property / cites work @@
+Solving the path cover problem on circular-arc graphs by using an approximation algorithm
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+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 @@
+An optimal path cover algorithm for cographs
@@ Property / cites work: An optimal path cover algorithm for cographs / rank @@
+Normal rank
@@ Property / cites work @@
+HAMILTONian circuits in chordal bipartite graphs
@@ Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A time-optimal solution for the path cover problem on cographs.
+Normal rank
@@ Property / cites work @@
+Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+A unified approach to domination problems on interval graphs
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint paths in graphs
@@ Property / cites work: Disjoint paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Solution to the Undirected Two Paths Problem
+Normal rank
@@ Property / cites work @@
+Optimal path cover problem on block graphs and bipartite permutation graphs
+Normal rank
@@ Property / cites work @@
+-linked graphs
@@ Property / cites work: 2-linked graphs / rank @@
+Normal rank
@@ Property / cites work @@
+ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES
@@ Property / cites work: ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES / rank @@
+Normal rank