Pages that link to "Item:Q1847390"
From MaRDI portal
The following pages link to Improved lower bound on the Shannon capacity of \(C_7\) (Q1847390):
Displaying 9 items.
- On the independence number of some strong products of cycle-powers (Q275570) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
- New lower bound on the Shannon capacity of \(C_7\) from circular graphs (Q1711423) (← links)
- \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) (← links)
- On the Shannon capacity of triangular graphs (Q1953512) (← links)
- Connectivity of strong products of graphs (Q1959713) (← links)
- New lower bounds for the Shannon capacity of odd cycles (Q2364621) (← links)
- The zero-error capacity of binary channels with 2-memories (Q6089460) (← links)