Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join

Nanano Kita

Minimum joins in a graft $(G,T)$, also known as minimum $T$-joins of a graph $G$, are said to be connected if they determine a connected subgraph of $G$. Grafts with a connected m…