Intersection graphs of paths in a tree
type: Item
instance of: scholarly article
title: Intersection graphs of paths in a tree
zbMATH Open document ID: 0595.05062
DOI: 10.1016/0095-8956(86)90042-0
published in: Journal of Combinatorial Theory. Series B
publication date: 1986-01-01T00:00:00Z
review text: See the preview in Zbl 0572.05049.
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 3957170
zbMATH Keywords: intersection graph
zbMATH Keywords: paths in a tree
zbMATH Keywords: perfect graphs
zbMATH Keywords: chordal
zbMATH Keywords: graphs
author: Clyde l. Monma
author: Victor K. Wei
MaRDI profile type: Publication
full work available at URL: 0095-8956(86)90042-0
OpenAlex ID: W1976489861
cites work: Q5603088
cites work: Q3941433
cites work: A characterisation of rigid circuit graphs
cites work: An efficient PQ-graph algorithm for solving the graph-realization problem
cites work: Incidence matrices with the consecutive 1’s property
cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: A recognition algorithm for the intersection graphs of directed paths in directed trees
cites work: A recognition algorithm for the intersection graphs of paths in trees
cites work: An algorithm for constructing edge-trees from hypergraphs
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Q3328583
cites work: Edge and vertex intersection of paths in a tree
cites work: Q5762903
cites work: A slice genus lower bound from \(sl(n)\) Khovanov-Rozansky homology
cites work: Intersection representations of graphs by arcs
cites work: Q4138414
cites work: Q4200254
cites work: Triangulated edge intersection graphs of paths in a tree
cites work: Decomposition by clique separators
cites work: Line perfect graphs
cites work: A New Algorithm for Generating All the Maximal Independent Sets
cites work: Matrix characterizations of circular-arc graphs
cites work: An algorithm for finding clique cut-sets
cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
cites work: The NP-Completeness of Edge-Coloring
description: scientific article; zbMATH DE number 3957170