×

zbMATH — the first resource for mathematics

A recognition algorithm for the intersection graphs of directed paths in directed trees. (English) Zbl 0312.05108

MSC:
05C20 Directed graphs (digraphs), tournaments
05C05 Trees
68W99 Algorithms in computer science
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Fulkerson, D.R.; Gross, O.A., Incidence matrices and interval graphs, Pacific J. math., 15, 835-855, (1965) · Zbl 0132.21001
[2] Gavril, F., Algorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph, SIAM J. comput., 1, 180-187, (1972) · Zbl 0227.05116
[3] Gavril, F., The intersection graphs of subtrees in trees are exactly the chordal graphs, J. combin. theory, 16, B, 47-56, (1974) · Zbl 0266.05101
[4] Gilmore, P.C.; Hoffman, H.J., A characterisation of comparability graphs and of interval graphs, Can. J. math., 16, 539-548, (1964) · Zbl 0121.26003
[5] Klee, V., What are the intersection graphs of arcs in a circle?, Am. math. monthly, 76, 810-813, (1969)
[6] Lekkerkerker, C.G.; Ch. Boland, J., Representation of a finite graph by a set of intervals on the real line, Fund. math., 51, 45-64, (1962) · Zbl 0105.17501
[7] Pnueli, A.; Lempel, A.; Even, S., Transitive orientation of graphs and identification of permutation graphs, Can. J. math., 23, 160-175, (1971) · Zbl 0204.24604
[8] Renz, P.L., Intersection representations of graphs by arcs, Pacific J. math., 34, 501-510, (1970) · Zbl 0191.55103
[9] Roberts, F., Indifference graphs, (), 139-146
[10] Rose, D.J., Triangulated graphs and the elimination process, J. math. anal. appl., 32, 597-609, (1970) · Zbl 0216.02602
[11] Tucker, A., Matrix characterisations of circular-arc graphs, Pacific J. math., 38, 535-545, (1971) · Zbl 0226.05125
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.