Premium
Graph dismantling problems
Author(s) -
Dawes A. M.,
Florence J. B.
Publication year - 1983
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190070306
Subject(s) - digraph , combinatorics , mathematics , graph , discrete mathematics , euler's formula , mathematical analysis
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.