Pages that link to "Item:Q1077439"
From MaRDI portal
The following pages link to Intersection graphs of paths in a tree (Q1077439):
Displaying 14 items.
- On asteroidal sets in chordal graphs (Q2448883) (← links)
- On the correspondence between tree representations of chordal and dually chordal graphs (Q2448885) (← links)
- Path Problems in Complex Networks (Q2913787) (← links)
- From Path Graphs to Directed Path Graphs (Q3057630) (← links)
- Characterizing directed path graphs by forbidden asteroids (Q3174239) (← links)
- Clique-coloring UE and UEH graphs (Q3503551) (← links)
- Path Partitions, Cycle Covers and Integer Decomposition (Q3655152) (← links)
- Coloring all directed paths in a symmetric tree, with an application to optical networks (Q4539866) (← links)
- Truly non-trivial graphoidal graphs (Q5097778) (← links)
- (Q5708495) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)
- Two new characterizations of path graphs (Q6056699) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
- Succinct data structure for path graphs (Q6178455) (← links)
