Intersecting longest paths (Q389499): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2013.02.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2015208587
@@ Property / OpenAlex ID: W2015208587 / rank @@
+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 @@
+Research problems
@@ Property / cites work: Research problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q2857437
@@ Property / cites work: Q2857437 / 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 @@
+Q3199444
@@ Property / cites work: Q3199444 / 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 @@
+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 @@
+A Theorem on Planar Graphs
@@ Property / cites work: A Theorem on Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3997887
@@ Property / cites work: Q3997887 / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner trees, partial 2–trees, and minimum IFI networks
+Normal rank
@@ Property / cites work @@
+Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
+Normal rank
@@ Property / cites work @@
+Über die Nichtexistenz zweier Knotenpunkte eines Graphen, die alle längsten Kreise fassen
+Normal rank
@@ Property / cites work @@
+Q4775880
@@ Property / cites work: Q4775880 / rank @@
+Normal rank
@@ Property / cites work @@
+A two-connected planar graph without concurrent longest paths
+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