Pages that link to "Item:Q1060226"
From MaRDI portal
The following pages link to Edge and vertex intersection of paths in a tree (Q1060226):
Displaying 40 items.
- Strong cliques and equistability of EPT graphs (Q260014) (← links)
- Graphs of edge-intersecting and non-splitting paths (Q288788) (← links)
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I (Q323036) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Parameterized maximum path coloring (Q392021) (← links)
- The recognition of triangle graphs (Q441856) (← links)
- Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs (Q468443) (← links)
- Subtree and substar intersection numbers (Q686262) (← links)
- Recognizing vertex intersection graphs of paths on bounded degree trees (Q741718) (← links)
- The edge intersection graphs of paths in a tree (Q792348) (← links)
- Tree representations of graphs (Q875046) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree (Q1003465) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Triangulated edge intersection graphs of paths in a tree (Q1061147) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- Intersection graphs of paths in a tree (Q1077439) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree (Q1318763) (← links)
- Clustering on trees (Q1392041) (← links)
- NeST graphs (Q1613397) (← links)
- On spectrum assignment in elastic optical tree-networks (Q1730219) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- Constant tolerance intersection graphs of subtrees of a tree (Q1764901) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- Dyadic representations of graphs (Q1783614) (← links)
- Subpath acyclic digraphs (Q1918551) (← links)
- Constant threshold intersection graphs of orthodox paths in trees (Q2184664) (← links)
- Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917) (← links)
- Helly EPT graphs on bounded degree trees: characterization and recognition (Q2404370) (← links)
- Intersection graphs of orthodox paths in trees (Q2413157) (← 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)
- On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid (Q2691570) (← links)
- Parameterized Maximum Path Coloring (Q2891353) (← links)
- A Refined Analysis of Online Path Coloring in Trees (Q2971164) (← links)
- Edge intersection graphs of single bend paths on a grid (Q3057113) (← links)
- Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid (Q5886040) (← links)
