Whitney's inequality on connectivity
theorem in graph theory
Press Enter · cited answer in seconds
0 sources
Whitney's inequality on connectivity
Summary
Whitney's inequality on connectivity is a theorem[1].
Key Facts
- Whitney's inequality on connectivity's instance of is recorded as theorem[2].
- Whitney's inequality on connectivity's different from is recorded as Whitney inequality[3].
- Whitney's inequality on connectivity's defining formula is recorded as \kappa(G)\leq \lambda(G)\leq \delta(G)[4].
- Whitney's inequality on connectivity's studied by is recorded as graph theory[5].
- Whitney's inequality on connectivity's in defining formula is recorded as G[6].
- Whitney's inequality on connectivity's in defining formula is recorded as \kappa(G)[7].
- Whitney's inequality on connectivity's in defining formula is recorded as \lambda(G)[8].
- Whitney's inequality on connectivity's in defining formula is recorded as \delta(G)[9].