The sufficiency of the divisibility condition for 6 2ᵏ divides complete tripartite graph K(m, n, s)

From MaRDI portal
Publication:5069795












This page was built for publication: The sufficiency of the divisibility condition for \(6 \times 2^k\) divides complete tripartite graph \(K(m, n, s)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069795)