Pages that link to "Item:Q1061147"
From MaRDI portal
The following pages link to Triangulated edge intersection graphs of paths in a tree (Q1061147):
Displayed 12 items.
- Strong cliques and equistability of EPT graphs (Q260014) (← links)
- Recognizing vertex intersection graphs of paths on bounded degree trees (Q741718) (← links)
- Edge and vertex intersection of paths in a tree (Q1060226) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Intersection graphs of paths in a tree (Q1077439) (← 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)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- Constant tolerance intersection graphs of subtrees of a tree (Q1764901) (← links)
- Intersection graphs of vertex disjoint paths in a tree (Q1903730) (← links)
- Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917) (← links)
- Representing edge intersection graphs of paths on degree 4 trees (Q2476278) (← links)