Author:
Botler F.,Fernandes C.G.,Gutiérrez J.
Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. Tuza's conjecture is asymptotically tight for dense graphs;Baron;Combin. Probab. Comput.,2016
2. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theoret. Comput. Sci.,1998
3. Graph Theory;Bondy,2008
4. On colouring the nodes of a network;Brooks;Math. Proc. Cambridge Philos. Soc.,1941
5. Sufficient conditions for Tuza's conjecture on packing and covering triangles;Chen,2016
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献