Intersection representations of graphs by arcs

DOI10.2140/PJM.1970.34.501zbMATH Open0191.55103OpenAlexW2006621708MaRDI QIDQ2538093FDOQ2538093

Authors: Peter L. Renz 

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

zbMATH Keywords

topology

Cited In (21)

• Truly non-trivial graphoidal graphs
• Structure theorems for some circular-arc 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
• Intersection graphs of paths in a tree
• Two new characterizations of path graphs
• Succinct data structure for path graphs
• Recognizing Helly edge-path-tree graphs and their clique graphs
• The forbidden subgraph characterization of directed vertex graphs
• Thresholds for classes of intersection graphs
• A recognition algorithm for the intersection graphs of directed paths in directed trees
• A recognition algorithm for the intersection graphs of paths in trees
• Recognition algorithm for intersection graphs of edge disjoint paths in a tree
• Graph theory
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Intersection graphs of vertex disjoint paths in a tree
• Characterizing path graphs by forbidden induced subgraphs
• Information storage and retrieval - mathematical foundations. II: Combinatorial problems
• A faster algorithm to recognize undirected path graphs
• Representations of graphs and networks (coding, layouts and embeddings)

This page was built for publication: Intersection representations of graphs by arcs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2538093)