Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
From MaRDI portal
Publication:323036
DOI10.1016/J.DAM.2015.07.024zbMATH Open1346.05133OpenAlexW2963628573MaRDI QIDQ323036FDOQ323036
Authors: Arman Boyacı, Tınaz Ekim, Mordechai Shalom, Shmuel Zaks 
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
Recommendations
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. II
- Graphs of edge-intersecting non-splitting paths in a tree: towards hole representations (extended abstract)
- Graphs of edge-intersecting and non-splitting paths
- Edge and vertex intersection of paths in a tree
- scientific article
Cites Work
- Edge and vertex intersection of paths in a tree
- Decomposition by clique separators
- Algorithmic graph theory and perfect graphs
- Representing edge intersection graphs of paths on degree 4 trees
- A New Algorithm for Generating All the Maximal Independent Sets
- The edge intersection graphs of paths in a tree
- Characterizing path graphs by forbidden induced subgraphs
- Edge intersection graphs of single bend paths on a grid
- Title not available (Why is that?)
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree
- The \(k\)-edge intersection graphs of paths in a tree
- On edge-intersection graphs of \(k\)-bend paths in grids
- A recognition algorithm for the intersection graphs of paths in trees
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Algorithms for weakly triangulated graphs
- Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations
Cited In (1)
This page was built for publication: Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323036)
