Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. Akiyama, J., Watanabe, M.: Maximum iduced forests of planar graphs. Graphs Comb. 1(3), 201–202 (1987)
2. Albertson, M.O., Berman, D.M.: A conjecture on planar graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Graph Theory and Related Topics, p. 357. Academic Press (1979)
3. Alon, N., Mubayi, D., Thomas, R.: Large induced forests in sparse graphs. J. Graph Theory 38(3), 113–123 (2001)
4. Borodin, O.V.: On acyclic colorings of planar graphs. Discrete Math. 25(3), 211–236 (1979)
5. Cranston, D.W., West, D.B.: A guide to the discharging method (2013).
arXiv:1306.4434
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Maximum Induced Forests of Product Graphs;Bulletin of the Malaysian Mathematical Sciences Society;2022-11-22
2. The size of graphs with given feedback vertex number;Discrete Applied Mathematics;2022-06
3. 3‐Degenerate induced subgraph of a planar graph;Journal of Graph Theory;2021-09-21