Graph dismantling problems
โ
A. M. Dawes; J. B. Florence
๐
Article
๐
1983
๐
John Wiley and Sons
๐
English
โ 526 KB
Problems involving the dismantling of a digraph (graph) by removal of arcs (edges) are investigated. Some of these problems have good characterizations related to the familiar results about Euler trails, others are NP-complete.