Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs
A k-colouring of a graph G with colours 1 , 2 , … , k is canonical with respect to an ordering π = v 1 , v 2 , … , v n of the vertices of G if adjacent vertices are assigned different colours and, for 1 ≤ c ≤ k , whenever colour c is...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-03-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | http://www.mdpi.com/1999-4893/11/4/40 |