Pages that link to "Item:Q1917300"
From MaRDI portal
The following pages link to Intersection graphs of Helly families of subtrees (Q1917300):
Displaying 15 items.
- Maximum weight independent sets and cliques in intersection graphs of filaments (Q294733) (← links)
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
- Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← links)
- Intersection graphs of concatenable subtrees of graphs (Q1331898) (← links)
- Algorithms for maximum weight induced paths (Q1603504) (← links)
- Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs (Q2091798) (← links)
- Families of induced trees and their intersection graphs (Q2132353) (← links)
- Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing. (Q2583532) (← links)
- Helly type theorem and graphs (Q2707489) (← links)
- Revisiting Tucker's algorithm to color circular-arc graphs (Q2741507) (← links)
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete (Q3508571) (← links)
- Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)
- Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)
