Feedback vertex sets in cubic multigraphs
暂无分享,去创建一个
[1] L. W. Beineke,et al. The decycling numbers of graphs , 2007 .
[2] Noga Alon,et al. Large induced forests in sparse graphs , 2001 .
[3] Ewald Speckenmeyer. On feedback vertex sets and nonseparating independent sets in cubic graphs , 1988, J. Graph Theory.
[4] Jiping Liu,et al. A new bound on the feedback vertex sets in cubic graphs , 1996, Discret. Math..
[5] William Staton,et al. Lower Bounds For Induced Forests in Cubic Graphs , 1987, Canadian Mathematical Bulletin.
[6] Noga Alon,et al. Large induced degenerate subgraphs , 1987, Graphs Comb..
[7] Xiaoyun Lu,et al. On the maximum induced forests of a connected cubic graph without triangles , 1990, Discret. Math..
[8] A. Vince. The integrity of a cubic graph , 2004, Discret. Appl. Math..
[9] Sheng Bau,et al. On the edge-chromatic number of a graph , 1973, Discret. Math..