Pages that link to "Item:Q5925535"
From MaRDI portal
The following pages link to On \(H\)-topological intersection graphs (Q5925535):
Displaying 12 items.
- Combinatorial problems on \(H\)-graphs (Q1689915) (← links)
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- On \(H\)-linked graphs (Q2502035) (← links)
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481) (← links)
- Graphs containing topological \(H\) (Q2811199) (← links)
- (Q4802725) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- Thinness and its variations on some graph families and coloring graphs of bounded thinness (Q6550911) (← links)
- Bisimplicial separators (Q6565812) (← links)