Nonempty intersection of longest paths in series-parallel graphs

In 1966 Gallai asked whether all longest paths in a connected graph have nonempty intersection. This is not true in general and various counterexamples have been found. However, the answer to Gallai's question is positive for several well-known classes of graphs, as for instance connected outerplanar graphs, connected split graphs, and 2-trees. A graph is series-parallel if it does not contain K 4 as a minor. Series-parallel graphs are also known as partial 2-trees, which are arbitrary subgraphs of 2-trees. We present two independent proofs that every connected series-parallel graph has a vertex that is common to all of its longest paths. Since 2-trees are maximal series-parallel graphs, and outerplanar graphs are also series-parallel, our result captures these two classes in one proof and strengthens them to a larger class of graphs. We also describe how one such vertex can be found in linear time.

[1]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[2]  Felix Joos,et al.  A Note on Longest Paths in Circular Arc Graphs , 2015, Discuss. Math. Graph Theory.

[3]  Cristina G. Fernandes,et al.  Intersecting longest paths , 2013, Discret. Math..

[4]  H. Voss.  Cycles and Bridges in Graphs , 1991 .

[5]  Stavros D. Nikolopoulos,et al.  The Longest Path Problem Is Polynomial on Cocomparability Graphs , 2011, Algorithmica.

[6]  Heinz-Jürgen Voss,et al.  Über Kreise in Graphen , 1974 .

[7]  Fred B. Schneider,et al.  A Theory of Graphs , 1993 .

[8]  Scott Kensell,et al.  Intersection of longest paths , 2011 .

[9]  Nobuji Saito,et al.  Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.

[10]  Hans L. Bodlaender,et al.  Dynamic Programming on Graphs with Bounded Treewidth , 1988, ICALP.

[11]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[12]  Paul Erdős,et al.  Theory of graphs : proceedings of the colloquium, held at Tihany, Hungary, September, 1966 , 1968 .

[13]  Michael J. Mossinghoff,et al.  Combinatorics and graph theory , 2000 .

[14]  Maria Axenovich.  When do Three Longest Paths have a Common Vertex? , 2009, Discret. Math. Algorithms Appl..

[15]  W. T. Tutte.  Graph Theory , 1984 .

[16]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[17]  Maria J. Serna,et al.  Counting H-colorings of partial k-trees , 2001, Theor. Comput. Sci..

[18]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[19]  Tudor Zamfirescu,et al.  On Longest Paths in Triangular Lattice Graphs , 2010 .

[20]  J. Sheehan.  GRAPH THEORY (Encyclopedia of Mathematics and Its Applications, 21) , 1986 .

[21]  Hans L. Bodlaender,et al.  On Linear Time Minor Tests with Depth-First Search , 1993, J. Algorithms.

[22]  Hansjoachim Walther,et al.  Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen , 1969 .

[23]  Branko Grünbaum,et al.  Vertices Missed by Longest Paths or Circuits , 1974, J. Comb. Theory, Ser. A.

[24]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[25]  Carsten Thomassen.  Planar and infinite hypohamiltonian and hypotraceable graphs , 1976, Discret. Math..

[26]  Zdzislaw Skupien,et al.  Smallest Sets of Longest Paths with Empty Intersection , 1996, Combinatorics, Probability and Computing.

[27]  Werner Schmitz.  Über längste Wege und Kreise in Graphen , 1975 .

[28]  Haiko Müller,et al.  Hamiltonian circuits in chordal bipartite graphs , 1996, Discret. Math..

[29]  Richard H. Schelp,et al.  Longest Paths in Circular Arc Graphs , 2004, Combinatorics, Probability and Computing.

[30]  Tudor Zamfirescu,et al.  On longest paths and circuits in graphs. , 1976 .

[31]  Carol T. Zamfirescu,et al.  Intersecting longest paths and longest cycles: A survey , 2013, Electron. J. Graph Theory Appl..