0 votes 0 votes proof :- A connected graph any two paths of maximum length share at least one vertex Graph Theory graph-theory graph-connectivity discrete-mathematics + – Neal Caffery asked Dec 12, 2016 Neal Caffery 233 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.