Pages that link to "Item:Q1689915"
From MaRDI portal
The following pages link to Combinatorial problems on \(H\)-graphs (Q1689915):
Displaying 13 items.
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation (Q2025063) (← links)
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481) (← links)
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
- Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
- (Q5009589) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- (Q5089162) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← 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)
