Representing edge intersection graphs of paths on degree 4 trees
暂无分享,去创建一个
Martin Charles Golumbic | Marina Lipshteyn | Michal Stern | M. Golumbic | Marina Lipshteyn | M. Stern | Michal Stern
[1] Martin Charles Golumbic,et al. Equivalences and the complete hierarchy of intersection graphs of paths in a tree , 2008, Discret. Appl. Math..
[2] Martin Charles Golumbic,et al. The k-edge intersection graphs of paths in a tree , 2008, Discret. Appl. Math..
[3] Henry Martyn Mulder,et al. Constant tolerance intersection graphs of subtrees of a tree , 2005, Discret. Math..
[4] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .
[5] Katerina Potika,et al. Resource Allocation Problems in Multifiber WDM Tree Networks , 2003, WG.
[6] Jeremy P. Spinrad,et al. Efficient graph representations , 2003, Fields Institute monographs.
[7] Pinar Heggernes,et al. Recognizing Weakly Triangulated Graphs by Edge Separability , 2000, Nord. J. Comput..
[8] Henry Martyn Mulder,et al. Tolerance intersection graphs on binary trees with constant tolerance 3 , 2000, Discret. Math..
[9] Jeremy P. Spinrad,et al. Weakly chordal graph algorithms via handles , 2000, SODA '00.
[10] Chính T. Hoàng,et al. Optimizing weakly triangulated graphs , 1990, Graphs Comb..
[11] Martin Charles Golumbic,et al. Edge and vertex intersection of paths in a tree , 1985, Discret. Math..
[12] Maciej M. Syslo,et al. Triangulated edge intersection graphs of paths in a tree , 1985, Discret. Math..
[13] Robert E. Tarjan,et al. Decomposition by clique separators , 1985, Discret. Math..
[14] Martin Charles Golumbic,et al. The edge intersection graphs of paths in a tree , 1985, J. Comb. Theory, Ser. B.
[15] Peter Buneman,et al. A characterisation of rigid circuit graphs , 1974, Discret. Math..
[16] M. Golumbic,et al. The recognition of k-EPT graphs , 2008 .
[17] Marina Lipshteyn. Structured Families of Graphs: Properties, Algorithms, and Representations , 2005 .
[18] P. Hell,et al. Graph Problems Arising from Wavelength-Routing in All-Optical Networks , 2004 .
[19] Klaus Jansen,et al. Scheduling of Virtual Connections in Fast Networks , 1996, Universität Trier, Mathematik/Informatik, Forschungsbericht.
[20] Chính T. Hoàng,et al. Optimizing weakly triangulated graphs , 1989 .
[21] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[22] Fanica Gavril,et al. A recognition algorithm for the intersection graphs of paths in trees , 1978, Discret. Math..