Triangulated edge intersection graphs of paths in a tree

DOI10.1016/0012-365X(85)90050-0zbMath0569.05045MaRDI QIDQ1061147

Maciej M. Sysło

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

EPTintersection graph of pathsVPT

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items

Intersection graphs of paths in a tree, Intersection graphs of vertex disjoint paths in a tree, Representations of graphs and networks (coding, layouts and embeddings), Representing edge intersection graphs of paths on degree 4 trees, Towards a comprehensive theory of conflict-tolerance graphs, Constant tolerance intersection graphs of subtrees of a tree, Recognizing Helly edge-path-tree graphs and their clique graphs, Recognizing vertex intersection graphs of paths on bounded degree trees, Edge and vertex intersection of paths in a tree, Interval graphs and related topics, Recognition algorithm for intersection graphs of edge disjoint paths in a tree, Strong cliques and equistability of EPT graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The edge intersection graphs of paths in a tree
• Edge and vertex intersection of paths in a tree
• A recognition algorithm for the intersection graphs of paths in trees
• Parallel concepts in graph theory
• Intersection representations of graphs by arcs
• On cycle bases of a graph