Author:
Bulteau Laurent,Fertin Guillaume,Labarre Anthony,Rizzi Romeo,Rusu Irena
Publisher
Springer International Publishing
Reference11 articles.
1. Bouchet, A., Fouquet, J.-L. Trois types de décompositions d’un graphe en chaénes. In: Berge, C., Bresson, D., Camion, P., Maurras, J.F., Sterboul, F. (eds.) Combinatorial Mathematics: Proceedings of the International Colloquium on Graph Theory and Combinatorics. North-Holland Mathematics Studies, vol. 75, pp. 131–141, North-Holland (1983)
2. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial Mathematics (1987)
3. Dor, D., Tarsi, M.: Graph decomposition is NP-complete: a complete proof of Holyer’s conjecture. SIAM J. Comput. 26, 1166–1187 (1997)
4. Dyer, M.E., Frieze, A.M.: On the complexity of partitioning graphs into connected subgraphs. Discrete Appl. Math. 10, 139–153 (1985)
5. Fusy, É.: Transversal structures on triangulations: a combinatorial study and straight-line drawings. Discrete Math. 309, 1870–1894 (2009)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献