Subtree filament graphs are subtree overlap graphs

Authors:
Jessica Enright;Lorna Stewart
Affiliations:
Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2E8;Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2E8
Venue:
Information Processing Letters
Year:
2007

Citing 7
Cited 3

Containment graphs, posets, and related classes of graphs

Proceedings of the third international conference on Combinatorial mathematics
The complexity of domination problems in circle graphs

Discrete Applied Mathematics
Graph classes: a survey

Graph classes: a survey
Maximum weight independent sets and cliques in intersection graphs of filaments

Information Processing Letters
Maximum independent set and maximum clique algorithms for overlap graphs

Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Approximating the minimum clique cover and other hard problems in subtree filament graphs

Discrete Applied Mathematics

Algorithms on Subtree Filament Graphs

Graph Theory, Computational Intelligence and Thought
Algorithms for induced biclique optimization problems

Information Processing Letters
Towards a comprehensive theory of conflict-tolerance graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.