Both papers proves that the conjecture holds with certain graphs. Are there more papers like these?
The second paper mentions that this holds in the case of two longest paths. What is the intuition behind this proof?
If the two paths didn't share a vertex then you could construct a new path using the two longest paths (since the graph is connected) that is longer than the longest paths, resulting in a contradiction.
Created May 05, 2020
© AsOne 2020