\(k\)-path-connectivity of the complete balanced tripartite graph \(K_{n, n, n}\) for \(n + 1 \leq k \leq 2 n - 4\) (Q6969940)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8054315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(k\)-path-connectivity of the complete balanced tripartite graph \(K_{n, n, n}\) for \(n + 1 \leq k \leq 2 n - 4\) |
scientific article; zbMATH DE number 8054315 |
Statements
\(k\)-path-connectivity of the complete balanced tripartite graph \(K_{n, n, n}\) for \(n + 1 \leq k \leq 2 n - 4\) (English)
0 references
19 June 2025
0 references
complete balanced tripartite graphs
0 references
path-connectivity
0 references
internally disjoint paths
0 references
Hamilton paths
0 references
