3204 search results - page 62 / 641 » The b-chromatic Number of a Graph |
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
ENDM
2000
13 years 9 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
IPL
2008
13 years 10 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...
JGT
2010
13 years 8 months ago
2010
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose