Covering planar graphs with forests, one having bounded maximum degree-Reference-Cited by-同舟云学术

Covering planar graphs with forests, one having bounded maximum degree

Published:2009-03 Issue:2 Volume:99 Page:314-322
ISSN:0095-8956
Container-title:Journal of Combinatorial Theory, Series B
language:en
Short-container-title:Journal of Combinatorial Theory, Series B

Author:

Gonçalves D.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference10 articles.

1. Covering planar graphs with forests;Balogh;J. Combin. Theory Ser. B,2005

2. A. Bassa, J. Burns, J. Campbell, A. Deshpande, J. Farley, M. Halsey, S. Michalakis, P.-O. Persson, P. Pylyavskyy, L. Rademacher, A. Riehl, M. Rios, J. Samuel, B. Tenner, A. Vijayasaraty, L. Zhao, D.J. Kleitman, Partitioning a planar graph of girth ten into a forest and a matching, manuscript, 2004

3. Decomposing a planar graph with girth 9 into a forest and a matching;Borodin;European J. Combin.,2008

4. Sur un nouvel invariant des graphes et un critère de planarité;Colin de Verdière;J. Combin. Theory Ser. B,1990

5. Caterpillar arboricity of planar graphs;Gonçalves;Discrete Math.,2007

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decompositions into two linear forests of bounded lengths;Discrete Mathematics;2024-06

2. Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions;Discrete Mathematics;2024-06

3. Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs;Applied Mathematics and Computation;2023-11

4. The Strong Nine Dragon Tree Conjecture is True for $$d \le k + 1$$;Combinatorica;2023-08-21

5. Towards Obtaining a 3-Decomposition From a Perfect Matching;The Electronic Journal of Combinatorics;2022-11-04