Pages that link to "Item:Q2538093"
From MaRDI portal
The following pages link to Intersection representations of graphs by arcs (Q2538093):
Displaying 21 items.
- The edge intersection graphs of paths in a tree (Q792348) (← links)
- Edge and vertex intersection of paths in a tree (Q1060226) (← links)
- Triangulated edge intersection graphs of paths in a tree (Q1061147) (← links)
- Intersection graphs of paths in a tree (Q1077439) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Thresholds for classes of intersection graphs (Q1201264) (← links)
- A recognition algorithm for the intersection graphs of directed paths in directed trees (Q1219893) (← links)
- Information storage and retrieval - mathematical foundations. II: Combinatorial problems (Q1235990) (← links)
- A recognition algorithm for the intersection graphs of paths in trees (Q1254334) (← 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 vertex disjoint paths in a tree (Q1903730) (← links)
- Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917) (← links)
- A faster algorithm to recognize undirected path graphs (Q2367409) (← links)
- The intersection graphs of subtrees in trees are exactly the chordal graphs (Q2562090) (← links)
- Structure theorems for some circular-arc graphs (Q2563173) (← links)
- Characterizing path graphs by forbidden induced subgraphs (Q3652563) (← links)
- Truly non-trivial graphoidal graphs (Q5097778) (← links)
- Graph theory (Q5917392) (← links)
- Two new characterizations of path graphs (Q6056699) (← links)
- Succinct data structure for path graphs (Q6178455) (← links)
