Pages that link to "Item:Q1070249"
From MaRDI portal
The following pages link to \(K_ i\)-covers. I: Complexity and polytopes (Q1070249):
Displaying 14 items.
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
- Generalized line graphs: Cartesian products and complexity of recognition (Q888591) (← links)
- On the 0,1 facets of the set covering polytope (Q1122477) (← links)
- On the facial structure of the set covering polytope (Q1122481) (← links)
- Gallai graphs and anti-Gallai graphs (Q1126196) (← links)
- On a composition of independence systems by circuit identification (Q1186136) (← links)
- The complexity of generalized clique covering (Q1262127) (← links)
- Iterated \(k\)-line graphs (Q1334947) (← links)
- A semidefinite approach to the $K_i$-cover problem (Q1667210) (← links)
- Composition of graphs and the triangle-free subgraph polytope (Q1810860) (← links)
- A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\) (Q1900147) (← links)
- Infinite \(\Phi\)-periodic graphs (Q1911989) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- Triangle packings and transversals of some \(K_{4}\)-free graphs (Q2413632) (← links)
