论文信息 - Subtree filament graphs are subtree overlap graphs - 字舞流文

Subtree filament graphs are subtree overlap graphs

We show that the class of intersection graphs of subtree filaments in a tree is identical to the class of overlap graphs of subtrees in a tree.

Jessica Enright | Lorna Stewart | Lorna Stewart | J. Enright

[1] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[2] Fanica Gavril,et al. Maximum weight independent sets and cliques in intersection graphs of filaments , 2000, Inf. Process. Lett..

[3] Martin Charles Golumbic,et al. The edge intersection graphs of paths in a tree , 1985, J. Comb. Theory, Ser. B.

[4] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .

[5] J. Mark Keil. The Complexity of Domination Problems in Circle Graphs , 1993, Discret. Appl. Math..

[6] Gary L. Miller,et al. The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.

[7] Lorna Stewart,et al. Approximating the minimum clique cover and other hard problems in subtree filament graphs , 2006, Discret. Appl. Math..

[8] Edward Szpilrajn-Marczewski. Sur deux propriétés des classes d'ensembles , 1945 .

[9] Fanica Gavril,et al. 3D-interval-filament graphs , 2007, Discret. Appl. Math..

[10] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[11] Lorna Stewart,et al. Maximum independent set and maximum clique algorithms for overlap graphs , 2003, Discret. Appl. Math..