Representing triangulated graphs in stars
From MaRDI portal
Publication:1261172
DOI10.1007/BF02941616zbMath0779.05039MaRDI QIDQ1261172
Publication date: 31 August 1993
Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)
tree; representation; intersection graph; triangulated graphs; partially ordered sets; interval graphs; star graph; star graphs; representable
05C05: Trees
06A07: Combinatorics of partially ordered sets
05C75: Structural characterization of families of graphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Some remarks on interval graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- A decomposition theorem for partially ordered sets
- Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
- Representation of a finite graph by a set of intervals on the real line
- On the tree representation of chordal graphs
- Representations of chordal graphs as subtrees of a tree
- Power of Natural Semijoins
- Algorithmic Aspects of Vertex Elimination on Graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs