Nonempty intersection of longest paths in series-parallel graphs (Q729758): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2016.07.023
@@ Property / DOI: 10.1016/j.disc.2016.07.023 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W1570138350
@@ Property / OpenAlex ID: W1570138350 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1376
@@ Property / arXiv ID: 1310.1376 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?
@@ Property / cites work: WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX? / rank @@
+Normal rank
@@ Property / cites work @@
+Longest Paths in Circular Arc Graphs
@@ Property / cites work: Longest Paths in Circular Arc Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4734761
@@ Property / cites work: Q4734761 / rank @@
+Normal rank
@@ Property / cites work @@
+On Linear Time Minor Tests with Depth-First Search
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q2839683
@@ Property / cites work: Q2839683 / rank @@
+Normal rank
@@ Property / cites work @@
+Research problems
@@ Property / cites work: Research problems / rank @@
+Normal rank
@@ Property / cites work @@
+Counting \(H-\)colorings of partial \(k-\)trees
@@ Property / cites work: Counting \(H-\)colorings of partial \(k-\)trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5537559
@@ Property / cites work: Q5537559 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertices missed by longest paths or circuits
@@ Property / cites work: Vertices missed by longest paths or circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q3508462
@@ Property / cites work: Q3508462 / rank @@
+Normal rank
@@ Property / cites work @@
+The longest path problem is polynomial on cocomparability graphs
+Normal rank
@@ Property / cites work @@
+Q3199444
@@ Property / cites work: Q3199444 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4276003
@@ Property / cites work: Q4276003 / 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 @@
+Intersecting longest paths
@@ Property / cites work: Intersecting longest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Über längste Wege und Kreise in Graphen
@@ Property / cites work: Über längste Wege und Kreise in Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Intersecting longest paths and longest cycles: A survey
+Normal rank
@@ Property / cites work @@
+Smallest Sets of Longest Paths with Empty Intersection
+Normal rank
@@ Property / cites work @@
+Planar and infinite hypohamiltonian and hypotraceable graphs
+Normal rank
@@ Property / cites work @@
+Q2703793
@@ Property / cites work: Q2703793 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3997887
@@ Property / cites work: Q3997887 / rank @@
+Normal rank
@@ Property / cites work @@
+Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
+Normal rank
@@ Property / cites work @@
+Q4775880
@@ Property / cites work: Q4775880 / rank @@
+Normal rank
@@ Property / cites work @@
+On longest paths and circuits in graphs.
@@ Property / cites work: On longest paths and circuits in graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3159270
@@ Property / cites work: Q3159270 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2016.07.023
@@ Property / DOI: 10.1016/J.DISC.2016.07.023 / rank @@
+Normal rank