Pages that link to "Item:Q1077439"
From MaRDI portal
The following pages link to Intersection graphs of paths in a tree (Q1077439):
Displayed 23 items.
- Clique graphs and Helly graphs (Q802632) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- An algorithm for fraternal orientation of graphs (Q1197981) (← links)
- Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
- A note on the Hamiltonian circuit problem on directed path graphs (Q1262132) (← links)
- Recognizing clique graphs of directed and rooted path graphs (Q1293208) (← links)
- The forbidden subgraph characterization of directed vertex graphs (Q1297413) (← links)
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree (Q1318763) (← links)
- Intersection graphs of concatenable subtrees of graphs (Q1331898) (← links)
- Completeness for intersection classes (Q1584399) (← links)
- Constant tolerance intersection graphs of subtrees of a tree (Q1764901) (← links)
- The separator theorem for rooted directed vertex graphs (Q1850517) (← links)
- Recognizing clique graphs of directed edge path graphs (Q1861580) (← links)
- Intersection graphs of vertex disjoint paths in a tree (Q1903730) (← links)
- Intersection graphs of Helly families of subtrees (Q1917300) (← links)
- Subpath acyclic digraphs (Q1918551) (← links)
- Modular intersection graphs (Q1923781) (← links)
- A faster algorithm to recognize undirected path graphs (Q2367409) (← links)
- Clique-coloring UE and UEH graphs (Q3503551) (← links)
- Coloring all directed paths in a symmetric tree, with an application to optical networks (Q4539866) (← links)
- (Q5708495) (← links)