Pages that link to "Item:Q5915791"
From MaRDI portal
The following pages link to On \(H\)-topological intersection graphs (Q5915791):
Displaying 16 items.
- Isomorphism testing for \(T\)-graphs in FPT (Q2154101) (← links)
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← 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)
- Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
- (Q5009468) (← links)
- (Q5009589) (← links)
- (Q5089162) (← links)
- Finding cut-vertices in the square roots of a graph (Q5915963) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- Recognizing Proper Tree-Graphs (Q6089652) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Recognition and isomorphism of proper \(H \)-graphs for unicyclic \(H\) in \textit{FPT}-time (Q6575404) (← links)
