The following pages link to (Q4448744):
Displaying 8 items.
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Distance-hereditary graphs are clique-perfect (Q2489948) (← links)
- The signed maximum-clique transversal number of regular graphs (Q4903571) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
