Decycling graphs
LW Beineke, RC Vandell - Journal of Graph Theory, 1997 - Wiley Online Library
In this paper, we introduce the decycling number of a graph as the minimum number of
vertices that must be removed in order to eliminate all cycles. After proving some general …
vertices that must be removed in order to eliminate all cycles. After proving some general …
[引用][C] Decycling graphs
LW Beineke, RC Vandell - Journal of Graph Theory, 1997 - dl.acm.org
Decycling graphs | Journal of Graph Theory skip to main content ACM Digital Library home
ACM home Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced …
ACM home Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced …