Pages that link to "Item:Q2476278"
From MaRDI portal
The following pages link to Representing edge intersection graphs of paths on degree 4 trees (Q2476278):
Displaying 17 items.
- Strong cliques and equistability of EPT graphs (Q260014) (← links)
- Graphs of edge-intersecting and non-splitting paths (Q288788) (← links)
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I (Q323036) (← links)
- Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs (Q468443) (← links)
- On the bend-number of planar and outerplanar graphs (Q477341) (← links)
- Recognizing vertex intersection graphs of paths on bounded degree trees (Q741718) (← links)
- Edge intersection graphs of systems of paths on a grid with a bounded number of bends (Q967371) (← links)
- Intersection models of weakly chordal graphs (Q1026105) (← links)
- On a unique tree representation for \(P_ 4\)-extendible graphs (Q1182318) (← links)
- On spectrum assignment in elastic optical tree-networks (Q1730219) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← 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)
- Edge-intersection graphs of grid paths: the bend-number (Q2440108) (← links)
- The \(k\)-edge intersection graphs of paths in a tree (Q2473042) (← links)
- Edge intersection graphs of single bend paths on a grid (Q3057113) (← links)
- (Q3576666) (← links)