A recognition algorithm for the intersection graphs of directed paths in directed trees
type: Item
instance of: scholarly article
title: A recognition algorithm for the intersection graphs of directed paths in directed trees
zbMATH Open document ID: 0312.05108
DOI: 10.1016/0012-365X(75)90021-7
published in: Discrete Mathematics
publication date: 1975-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 3487478
author: Fanica Gavril
MaRDI profile type: Publication
cites work: Incidence matrices and interval graphs
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 Characterization of Comparability Graphs and of Interval Graphs
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs
cites work: Intersection representations of graphs by arcs
cites work: Q5588432
cites work: Triangulated graphs and the elimination process
cites work: Matrix characterizations of circular-arc graphs
full work available at URL: 0012-365x(75)90021-7
OpenAlex ID: W1993412054
Wikidata QID: Q127740725
description: scientific article; zbMATH DE number 3487478