Author:
Brandstädt Andreas,Hundt Christian,Mancini Federico,Wagner Peter
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference35 articles.
1. The isomorphism problem for directed path graphs and for rooted directed path graphs;Babel;J. Algorithms,1996
2. Distance hereditary graphs;Bandelt;J. Combin. Theory (B),1986
3. Neighborhood subtree tolerance graphs;Bibelnieks;Discrete Appl. Math.,1993
4. Tree spanners on chordal graphs: Complexity and algorithms;Brandstädt;Theoret. Comput. Sci.,2004
5. A. Brandstädt, C. Hundt, Ptolemaic graphs and interval graphs are leaf powers, Extended abstract, in: Conf. Proceedings of LATIN. 2008, in: LNCS, vol. 4957, pp. 479–491
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献