Bi-traceable graphs, the intersection of three longest paths and Hippchen's conjecture

MaRDI QIDQ6358620zbMATH OpenFDO

Authors Juan Gutiérrez, Christian Valqui

Publication date 19 January 2021

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Abstract: Let $P,Q$ be longest paths in a simple graph. We analyze the possible connections between the components of $PcupQsetminus(V(P)capV(Q))$ and introduce the notion of a bi-traceable graph. We use the results for all the possible configurations of the intersection points when $$ in order to prove that if the intersection of three longest paths $P,Q,R$ is empty, then $$. We also prove Hippchen's conjecture for $kle6$: If a graph $G$ is $k$-connected for $kle6$, and $P$ and $Q$ are longest paths in $G$, then $$.

This page was built for publication: Bi-traceable graphs, the intersection of three longest paths and Hippchen's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6358620)