354 search results - page 15 / 71 » The Chromatic Number Of Graph Powers |
SIAMDM
2010
13 years 5 months ago
2010
CMA
2010
13 years 4 months ago
2010
DM
2008
13 years 7 months ago
2008
For any graph G, the k-improper chromatic number k (G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree ...
IPL
2008
13 years 7 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(y) is an arc in H whenever xy is an arc in G. The or...
EJC
2006
13 years 7 months ago
2006
The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphis...