Pages that link to "Item:Q1974525"
From MaRDI portal
The following pages link to Tolerance intersection graphs on binary trees with constant tolerance 3 (Q1974525):
Displaying 20 items.
- Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs (Q468443) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Recognizing vertex intersection graphs of paths on bounded degree trees (Q741718) (← links)
- Generalized disk graphs (Q832849) (← links)
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree (Q1003465) (← links)
- Intersection models of weakly chordal graphs (Q1026105) (← links)
- NeST graphs (Q1613397) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- Constant tolerance intersection graphs of subtrees of a tree (Q1764901) (← links)
- Dyadic representations of graphs (Q1783614) (← links)
- Constant threshold intersection graphs of orthodox paths in trees (Q2184664) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 (Q2374177) (← 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)
- Constant tolerance representations of graphs in trees (Q2717917) (← links)
- \(K_{1,3}\)-subdivision tolerance representations of cycles (Q2869323) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- What Is between Chordal and Weakly Chordal Graphs? (Q5302062) (← links)
