Pages that link to "Item:Q1068110"
From MaRDI portal
The following pages link to Clustering and domination in perfect graphs (Q1068110):
Displaying 6 items.
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (Q6500104) (← links)
- Stackelberg strategies on epidemic containment games (Q6535824) (← links)
- Open packing in \(H\)-free graphs and subclasses of split graphs (Q6547836) (← links)
- The sparse sequences of graphs (Q6640961) (← links)