The path-partition problem in block graphs (Q1342260): Difference between revisions

@@ Property / OpenAlex ID @@
+W1981160730
@@ Property / OpenAlex ID: W1981160730 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear algorithm for optimal path cover problem on interval graphs
+Normal rank
@@ Property / cites work @@
+The $L(2,1)$-Labeling Problem on Graphs
@@ Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum node disjoint path covering for circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Hamiltonian cycle is polynomial on cocomparability graphs
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
+Normal rank
@@ Property / cites work @@
+Hamiltonian circuits and path coverings of vertices in graphs
+Normal rank
@@ Property / cites work @@
+Optimal path cover problem on block graphs and bipartite permutation graphs
+Normal rank