Graph TheoryHardWalks, Paths and Connectivity
Walks, Paths and Connectivity · Hard problem
Let consist of two copies of that share exactly one vertex: one on vertices and the other on vertices (so vertex belongs to both, and there is no edge directly joining to ). Find .