Pages that link to "Item:Q2473042"
From MaRDI portal
The following pages link to The \(k\)-edge intersection graphs of paths in a tree (Q2473042):
Displaying 18 items.
- 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)
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676) (← links)
- Recognizing vertex intersection graphs of paths on bounded degree trees (Q741718) (← links)
- The edge intersection graphs of paths in a tree (Q792348) (← links)
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree (Q1003465) (← links)
- Intersection models of weakly chordal graphs (Q1026105) (← links)
- A superclass of edge-path-tree graphs with few cliques (Q1038105) (← links)
- Edge and vertex intersection of paths in a tree (Q1060226) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- On superperfection of edge intersection graphs of paths (Q2056890) (← links)
- Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 (Q2374177) (← links)
- Representing edge intersection graphs of paths on degree 4 trees (Q2476278) (← links)
- Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing. (Q2583532) (← links)
- (Q3576666) (← links)
- Path Partitions, Cycle Covers and Integer Decomposition (Q3655152) (← links)
- Edge-Intersection Graphs of k-Bend Paths in Grids (Q5323053) (← links)
- Injective coloring of subclasses of chordal graphs (Q6652425) (← links)
