On colouring products of graphs
Dănuţ Marcu (1996)
Mathematica Bohemica
Similarity:
In this paper, we give some results concerning the colouring of the product (cartesian product) of two graphs.
Displaying similar documents to “A note on chromatic number of direct product of graphs”
On colouring products of graphs
Upper and lower bounds for .
Xu, Xiaodong, Luo, Haipeng, Shao, Zehui (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Homomorphisms of complete n-partite graphs.
Girse, Robert D. (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Colouring the petals of a graph.
Cariolaro, David, Cariolaro, Gianfranco (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graph powers and graph homomorphisms.
Hajiabolhassan, Hossein, Taherkhani, Ali (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Uniquely -colorable and chromatically equivalent graphs.
Chao, Chong-Yun (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity: