Pages that link to "Item:Q807634"
From MaRDI portal
The following pages link to A simple lower bound on edge coverings by cliques (Q807634):
Displayed 7 items.
- On the kernel size of clique cover reductions for random intersection graphs (Q491163) (← links)
- Hardness results for covering arrays avoiding forbidden edges and error-locating arrays (Q650881) (← links)
- Edge-clique covers of the tensor product (Q897963) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Generalized covering designs and clique coverings (Q3100732) (← links)
- Редукция графа при поиске реберного покрытия минимальным числом клик (Q4959050) (← links)