Subtree filament graphs are subtree overlap graphs

DOI10.1016/j.ipl.2007.07.004zbMath1183.05017OpenAlexW2060670627MaRDI QIDQ2380028

Jessica Enright, Lorna K. Stewart

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.07.004

zbMATH Keywords

combinatorial problemsgraph algorithmsoverlap graphsubtree filament graphsubtree overlap graph

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (8)

New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs ⋮ Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs ⋮ Maximum max-k-clique subgraphs in cactus subtree graphs ⋮ Algorithms for induced biclique optimization problems ⋮ Towards a comprehensive theory of conflict-tolerance graphs ⋮ Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs ⋮ On-line approach to off-line coloring problems on graphs with geometric representations ⋮ Algorithms on Subtree Filament Graphs

Cites Work

• Maximum weight independent sets and cliques in intersection graphs of filaments
• The edge intersection graphs of paths in a tree
• The complexity of domination problems in circle graphs
• Maximum independent set and maximum clique algorithms for overlap graphs
• Algorithmic graph theory and perfect graphs
• Approximating the minimum clique cover and other hard problems in subtree filament graphs
• The Complexity of Coloring Circular Arcs and Chords
• Containment Graphs, Posets, and Related Classes of Graphs
• Graph Classes: A Survey
• Sur deux propriétés des classes d'ensembles

This page was built for publication: Subtree filament graphs are subtree overlap graphs