3204 search results - page 17 / 641 » The b-chromatic Number of a Graph |
COMBINATORICS
2006
13 years 7 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
JGT
2006
13 years 7 months ago
2006
Following [1], we investigate the problem of covering a graph G with induced subgraphs G1, . . . , Gk of possibly smaller chromatic number, but such that for every vertex u of G, ...
IWPEC
2010
Springer
13 years 5 months ago
2010
Springer
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm ...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...