Related papers: Any Three Longest Paths In A Connected Graph Has A…
In 1966, T. Gallai asked whether every connected graph has a vertex that appears in all longest paths. Since then this question has attracted much attention and many work has been done in this topic. One important open question in this area…
It is easy to see that in a connected graph any 2 longest paths have a vertex in common. For k>=7, Skupien in [7] obtained a connected graph in which some k longest paths have no common vertex, but every k-1 longest paths have a common…
We present progress on three old conjectures about longest paths and cycles in graphs. The first pair of conjectures, due to Lov\'{a}sz from 1969 and Thomassen from 1978, respectively, states that all connected vertex-transitive 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…
In 1966, Gallai asked whether all longest paths in a connected graph share a common vertex. Counterexamples indicate that this is not true in general. However, Gallai's question is positive for certain well-known classes of connected…
A well-known question of Gallai (1966) asked whether there is a vertex which passes through all longest paths of a connected graph. Although this has been verified for some special classes of graphs such as outerplanar graphs, circular arc…
A detour in a graph is a longest path. This thesis is mainly about connected, non-traceable graphs with the property that each vertex is the start (or end) vertex of a detour. There are also related results on claw-free, 2-connected,…
We show that every pair of longest paths in a $k$-connected graph on $n$ vertices intersect each other in at least $(8k-n+2)/5$ vertices. We also show that, in a 4-connected graph, every pair of longest paths intersect each other in at…
We show that connected graphs admit sublinear longest path transversals. This improves an earlier result of Rautenbach and Sereni and is related to the fifty-year-old question of whether connected graphs admit longest path transversals of…
Let $P,Q$ be longest paths in a simple graph. We analyze the possible connections between the components of $P\cup Q\setminus (V(P)\cap V(Q))$ and introduce the notion of a bi-traceable graph. We use the results for all the possible…
Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex. We consider a variant of this classical problem in which the position of each…
We prove that every 3-connected planar graph on $n$ vertices contains an induced path on $\Omega(\log n)$ vertices, which is best possible and improves the best known lower bound by a multiplicative factor of $\log \log n$. We deduce that…
As observed by Rautenbach and Sereni (arXiv:1302.5503) there is a gap in the proof of the theorem of Balister et al. (Longest paths in circular arc graphs, Combin. Probab. Comput., 13, No. 3, 311-317 (2004)), which states that the…
Thomassen's chord conjecture from 1976 states that every longest cycle in a $3$-connected graph has a chord. This is one of the most important unsolved problems in graph theory. Let $H$ be a subgraph of a graph $G$. A vertex $v$ of $H$ is…
In 1979 Babai found a clever argument to prove that every connected vertex transitive graph on $n \ge 3$ vertices contains a cycle of length at least $\sqrt{3n}$. Here we modify his approach to show that such graphs must contain a cycle of…
A supergrid graph is a finite vertex-induced subgraph of the infinite graph whose vertex set consists of all points of the plane with integer coordinates and in which two vertices are adjacent if the difference of their x or y coordinates…
Let v(G) and p(G) be the number of vertices and the maximum number of disjoint 3-vertex paths in G, respectively. We discuss the following old Problem: Is the following claim (P) true ? (P) if G is a 3-connected and cubic graph, then p(G) =…
We make progress toward a characterization of the graphs $H$ such that every connected $H$-free graph has a longest path transversal of size $1$. In particular, we show that the graphs $H$ on at most $4$ vertices satisfying this property…
A graph is path-pairable if for any pairing of its vertices there exist edge-disjoint paths joining the vertices in each pair. We investigate the behaviour of the maximum degree in path-pairable planar graphs. We show that any $n$-vertex…
A conjecture attributed to Smith states that every pair of longest cycles in a $k$-connected graph intersect each other in at least $k$ vertices. In this paper, we show that every pair of longest cycles in a~$k$-connected graph on $n$…