Article contents
The bichromaticity of a lattice-graph
Published online by Cambridge University Press: 09 April 2009
Abstract
The 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}.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1977
References
- 1
- Cited by