On the structure of contractible edges in \(k\)-connected partial \(k\)-trees (Q844219): Difference between revisions

An edge in a graph is contractible if its contraction does not decrease the connectivity. In the paper the authors present results on the structure of contractible edges in \(k\)-trees and \(k\)-connected partial \(k\)-trees. They also construct a class of contraction critical \(2k\)-connected partial \(2k\)-trees.