The decycling numbers of graphs

arXiv preprint math/0703544, 2007 - arxiv.org
For a graph $ G $ and $ S\subset V (G) $, if $ GS $ is acyclic, then $ S $ is said to be a
decycling set of $ G $. The size of a smallest decycling set of $ G $ is called the decycling …
被引用次数：6 相关文章

The decycling numbers of graphs

S Bau, LW Beineke - arXiv Mathematics e-prints, 2007 - ui.adsabs.harvard.edu
For a graph $ G $ and $ S\subset V (G) $, if $ GS $ is acyclic, then $ S $ is said to be a
decycling set of $ G $. The size of a smallest decycling set of $ G $ is called the decycling …
[PDF] researchgate.net

[PDF][PDF] The Decycling Number of Graphs

S Bau - arXiv preprint math/0703544 - researchgate.net
For a graph G and S⊂ V (G), if G− S is acyclic, then S is said to be a decycling set of G. The
size of a smallest decycling set of G is called the decycling number of G. The purpose of this …
[PDF] psu.edu

[PDF][PDF] THE DECYCLING NUMBER OF GRAPHS

S BAU, LW BEINEKE - Citeseer
For a graph G and S⊂ V (G), if G− S is acyclic, then S is said to be a decycling set of G. The
size of a smallest decycling set of G is called the decycling number of G. The purpose of this …