Intersection representations of graphs by arcs
From MaRDI portal
Publication:2538093
DOI10.2140/pjm.1970.34.501zbMath0191.55103OpenAlexW2006621708MaRDI QIDQ2538093
Publication date: 1970
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1970.34.501
Related Items
Intersection graphs of paths in a tree, A faster algorithm to recognize undirected path graphs, Intersection graphs of vertex disjoint paths in a tree, Truly non-trivial graphoidal graphs, Two new characterizations of path graphs, Succinct data structure for path graphs, Representations of graphs and networks (coding, layouts and embeddings), Thresholds for classes of intersection graphs, A recognition algorithm for the intersection graphs of directed paths in directed trees, Recognizing Helly edge-path-tree graphs and their clique graphs, Information storage and retrieval - mathematical foundations. II: Combinatorial problems, Graph theory, A recognition algorithm for the intersection graphs of paths in trees, Characterizing path graphs by forbidden induced subgraphs, The intersection graphs of subtrees in trees are exactly the chordal graphs, Structure theorems for some circular-arc graphs, The forbidden subgraph characterization of directed vertex graphs, The edge intersection graphs of paths in a tree, Edge and vertex intersection of paths in a tree, Triangulated edge intersection graphs of paths in a tree, Recognition algorithm for intersection graphs of edge disjoint paths in a tree
