The edge intersection graphs of paths in a tree
Data up to Jan 2025
Total Citations Per Year
Abstract
References (20)
Algorithmic Graph Theory and Perfect Graphs
2004 • 3,945 citations
Decomposition by clique separators
1985 • 432 citations
A Theorem on Coloring the Lines of a Network
1949 • 296 citations
Coloring a Family of Circular Arcs
1975 • 221 citations
The strong perfect-graph conjecture is true for K1,3-free graphs
1976 • 131 citations
Partition numbers for trees and ordered sets
1981 • 108 citations
A recognition algorithm for the intersection graphs of paths in trees
1978 • 104 citations
Critical perfect graphs and perfect 3-chromatic graphs
1977 • 69 citations
Intersection representations of graphs by arcs
1970 • 63 citations
The Strong Perfect Graph Conjecture for Planar Graphs
1973 • 60 citations
Line perfect graphs
1977 • 59 citations
The validity of the strong perfect-graph conjecture for (K4−e)-free graphs
1979 • 53 citations
A recognition algorithm for the intersection graphs of paths in trees
1978 • 30 citations
Information storage and retrieval — mathematical foundations II (combinatorial problems)
1976 • 20 citations
The Strong Perfect Graph Theorem for a Class of Partitionable Graphs
1984 • 18 citations
An Efficient Algorithm for Colouring the Edges of a Graph With Δ + 1 Colours
1982 • 10 citations
Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture
1983 • 9 citations
The strong perfect graph conjecture for toroifal graphs
1981 • 6 citations
Recent Results on The Strong Perfect Graph Conjecture
1984 • 3 citations
The Helly-type property of non-trivial intervals on a tree
1981 • 2 citations