Intersection graphs of Helly families of subtrees

DOI10.1016/0166-218X(94)00136-2zbMath0856.05084MaRDI QIDQ1917300

Fanica Gavril

Publication date: 7 July 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

intersection graph; subtrees; Helly family

Mathematics Subject Classification ID

05C05: Trees

05C75: Structural characterization of families of graphs

Related Items

Intersection representations of matrices by subtrees and unicycles on graphs, Algorithms for maximum weight induced paths, Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing., Unnamed Item, Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete

Cites Work

• Unnamed Item
• A linear algorithm for the group path problem on chordal graphs
• Efficient reduction for path problems on circular-arc graphs
• Intersection graphs of paths in a tree
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Triangulated graphs and the elimination process
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Generating the maximum spanning trees of a weighted graph
• On the tree representation of chordal graphs
• The Complexity of Coloring Circular Arcs and Chords
• Algorithms on circular-arc graphs
• Coloring a Family of Circular Arcs
• A New Algorithm for Generating All the Maximal Independent Sets
• A Linear Time Algorithm for Deciding Interval Graph Isomorphism
• Characterizing circular-arc graphs