The following pages link to (Q3576666):
Displaying 11 items.
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I (Q323036) (← links)
- The edge intersection graphs of paths in a tree (Q792348) (← links)
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree (Q1003465) (← links)
- Intersection models of weakly chordal graphs (Q1026105) (← links)
- Edge and vertex intersection of paths in a tree (Q1060226) (← links)
- A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree (Q2185817) (← links)
- Helly EPT graphs on bounded degree trees: characterization and recognition (Q2404370) (← links)
- The \(k\)-edge intersection graphs of paths in a tree (Q2473042) (← links)
- Representing edge intersection graphs of paths on degree 4 trees (Q2476278) (← links)
- Edge intersection graphs of single bend paths on a grid (Q3057113) (← links)
- Représentations en arbre de proximités relatives (Q3635500) (← links)
