Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I

DOI10.1016/j.dam.2015.07.024zbMath1346.05133OpenAlexW2963628573MaRDI QIDQ323036

Arman Boyacı, Shmuel Zaks, Tınaz Ekim, Mordechai Shalom

Publication date: 7 October 2016

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

Full work available at URL: https://doi.org/10.1016/j.dam.2015.07.024

zbMATH Keywords

intersection graphsEPT graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum weight independent sets and cliques in intersection graphs of filaments
• The edge intersection graphs of paths in a tree
• Equivalences and the complete hierarchy of intersection graphs of paths in a tree
• Edge and vertex intersection of paths in a tree
• Decomposition by clique separators
• A recognition algorithm for the intersection graphs of paths in trees
• Algorithmic graph theory and perfect graphs
• Algorithms for weakly triangulated graphs
• The \(k\)-edge intersection graphs of paths in a tree
• Representing edge intersection graphs of paths on degree 4 trees
• Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations
• Edge intersection graphs of single bend paths on a grid
• Characterizing path graphs by forbidden induced subgraphs
• A New Algorithm for Generating All the Maximal Independent Sets

This page was built for publication: Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I