A Better Bound on the Largest Induced Forests in Triangle-Free Planar Graph
暂无分享,去创建一个
[1] Riste Skrekovski,et al. An improved bound on the largest induced forests for triangle-free planar graphs , 2010, Discret. Math. Theor. Comput. Sci..
[2] Xingxing Yu,et al. Induced Forests in Bipartite Planar Graphs , 2016 .
[3] Chun-Hung Liu,et al. Size of the largest induced forest in subcubic graphs of girth at least four and five , 2018, J. Graph Theory.
[4] Jin Akiyama,et al. Maximum induced forests of planar graphs , 1987, Graphs Comb..
[5] Xiaotie Deng,et al. Smallest regular graphs with girth pair (4, 2t+1) , 1985, Graphs Comb..
[6] Robin Thomas,et al. Large induced forests in sparse graphs , 2001, J. Graph Theory.
[7] Daniel W. Cranston,et al. An introduction to the discharging method via graph coloring , 2013, Discret. Math..
[8] Mohammad R. Salavatipour. Large Induced Forests in Triangle-Free Planar Graphs , 2006, Graphs Comb..
[9] Ján Mazák,et al. Maximum 4-Degenerate Subgraph of a Planar Graph , 2015, Electron. J. Comb..
[10] Mickaël Montassier,et al. Large induced forests in planar graphs with girth 4 or 5 , 2014, Discret. Appl. Math..
[11] Oleg V. Borodin. On acyclic colorings of planar graphs , 1979, Discret. Math..