The bichromaticity of a lattice-graph
1977 ◽
Vol 23
(3)
◽
pp. 354-359
◽
Keyword(s):
AbstractThe bichromaticity β(B) of a bipartite graph B has been defined as the maximum order of a complete bipartite graph onto which B is homomorphic. This number was previously determined for trees and even cycles. It is now shown that for a lattice-graph Pm × Pm the cartesian product of two paths, the bichromaticity is 2 + {mn/2}.
Keyword(s):
2016 ◽
Vol Vol. 18 no. 3
(Graph Theory)
◽
Keyword(s):
2018 ◽
Vol 9
(12)
◽
pp. 2147-2152
Keyword(s):
Keyword(s):