Representing triangulated graphs in stars

DOI10.1007/BF02941616zbMath0779.05039MaRDI QIDQ1261172

Erich Prisner

Publication date: 31 August 1993

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

zbMATH Keywords

treerepresentationintersection graphtriangulated graphspartially ordered setsinterval graphsstar graphstar graphsrepresentable

Mathematics Subject Classification ID

Trees (05C05) Combinatorics of partially ordered sets (06A07) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The neighborhood polynomial of chordal graphs ⋮ The Neighborhood Polynomial of Chordal Graphs ⋮ Subgraph trees in graph theory ⋮ Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage

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

This page was built for publication: Representing triangulated graphs in stars