Pages that link to "Item:Q1764901"
From MaRDI portal
The following pages link to Constant tolerance intersection graphs of subtrees of a tree (Q1764901):
Displaying 22 items.
- 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)
- Tree representations of graphs (Q875046) (← links)
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree (Q1003465) (← links)
- Intersection models of weakly chordal graphs (Q1026105) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- Dyadic representations of graphs (Q1783614) (← links)
- Tolerance intersection graphs on binary trees with constant tolerance 3 (Q1974525) (← links)
- Constant threshold intersection graphs of orthodox paths in trees (Q2184664) (← links)
- A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree (Q2185817) (← links)
- Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 (Q2374177) (← links)
- Helly EPT graphs on bounded degree trees: characterization and recognition (Q2404370) (← links)
- Intersection graphs of orthodox paths in trees (Q2413157) (← links)
- The vertex leafage of chordal graphs (Q2442202) (← 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)
- Constant tolerance representations of graphs in trees (Q2717917) (← links)
- \(K_{1,3}\)-subdivision tolerance representations of cycles (Q2869323) (← links)
- Caterpillar tolerance representations (Q2910023) (← links)
- Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid (Q3104787) (← links)
- What Is between Chordal and Weakly Chordal Graphs? (Q5302062) (← links)
