Pages that link to "Item:Q2110610"
From MaRDI portal
The following pages link to Treewidth versus clique number in graph classes with a forbidden structure (Q2110610):
Displaying 5 items.
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (Q6500104) (← links)
