Pages that link to "Item:Q792348"
From MaRDI portal
The following pages link to The edge intersection graphs of paths in a tree (Q792348):
Displaying 17 items.
- On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid (Q2691570) (← links)
- Single bend paths on a grid have strong Helly number 4: errata atque emendationes ad ``Edge intersection graphs of single bend paths on a grid'' (Q2811306) (← links)
- A Refined Analysis of Online Path Coloring in Trees (Q2971164) (← links)
- Edge intersection graphs of single bend paths on a grid (Q3057113) (← links)
- Clique-coloring UE and UEH graphs (Q3503551) (← links)
- (Q3576666) (← links)
- Coloring all directed paths in a symmetric tree, with an application to optical networks (Q4539866) (← links)
- Colouring paths in directed symmetric trees with applications to WDM routing (Q4571981) (← links)
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- Optimal pricing of capacitated networks (Q5191131) (← links)
- Strong Pseudo Transitivity and Intersection Graphs (Q5224759) (← links)
- Constraint Satisfaction with Counting Quantifiers (Q5256528) (← links)
- What Is between Chordal and Weakly Chordal Graphs? (Q5302062) (← links)
- Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid (Q5886040) (← links)
- The complexity of path coloring and call scheduling (Q5941061) (← links)
- Fractional path coloring in bounded degree trees with applications (Q5961980) (← links)
- On non-superperfection of edge intersection graphs of paths (Q6670498) (← links)
