A recognition algorithm for the intersection graphs of directed paths in directed trees
- 31 December 1975
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 13 (3) , 237-249
- https://doi.org/10.1016/0012-365x(75)90021-7
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- Matrix characterizations of circular-arc graphsPacific Journal of Mathematics, 1971
- Transitive Orientation of Graphs and Identification of Permutation GraphsCanadian Journal of Mathematics, 1971
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Intersection representations of graphs by arcsPacific Journal of Mathematics, 1970
- What Are the Intersection Graphs of Arcs in a Circle?The American Mathematical Monthly, 1969
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962