The edge intersection graphs of paths in a tree
- 1 February 1985
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 38 (1) , 8-22
- https://doi.org/10.1016/0095-8956(85)90088-7
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Partitionable graphs, circle graphs, and the berge strong perfect graph conjectureDiscrete Mathematics, 1983
- The Helly-type property of non-trivial intervals on a treeDiscrete Mathematics, 1981
- Partition numbers for trees and ordered setsPacific Journal of Mathematics, 1981
- The strong perfect graph conjecture for toroifal graphsJournal of Combinatorial Theory, Series B, 1981
- The validity of the strong perfect-graph conjecture for (K4−e)-free graphsJournal of Combinatorial Theory, Series B, 1979
- A recognition algorithm for the intersection graphs of paths in treesDiscrete Mathematics, 1978
- Information storage and retrieval — mathematical foundations II (combinatorial problems)Theoretical Computer Science, 1976
- The strong perfect-graph conjecture is true for K1,3-free graphsJournal of Combinatorial Theory, Series B, 1976
- Intersection representations of graphs by arcsPacific Journal of Mathematics, 1970
- A Theorem on Coloring the Lines of a NetworkJournal of Mathematics and Physics, 1949