Pages that link to "Item:Q799696"
From MaRDI portal
The following pages link to Upper bounds on the edge clique cover number of a graph (Q799696):
Displaying 12 items.
- A simple lower bound on edge coverings by cliques (Q807634) (← links)
- Edge-clique covers of the tensor product (Q897963) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- Maximum set of edges no two covered by a clique (Q1084407) (← links)
- Clique covering of graphs (Q1100482) (← links)
- Edge clique covering sum of graphs (Q1701317) (← links)
- Clique coverings of the edges of a random graph (Q2367438) (← links)
- On the graph inequality \(\theta _{E}(G)\geqslant \theta _{E}(G^{m})\) (Q2495511) (← links)
- The asymptotic order of the abdiff-tolerance edge clique cover number of \(K_{2,n}\) (Q2717911) (← links)
- A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs (Q2915034) (← links)
- (Q3472129) (← links)
- Edge clique covers in graphs with independence number two (Q6055943) (← links)