3211 search results - page 24 / 643 » On the Grundy Number of a Graph |
JGT
2006
14 years 11 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, ...
117
click to vote
COCOON
2007
Springer
15 years 6 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...
118
click to vote
RSA
2008
14 years 11 months ago
2008
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
DM
1998
14 years 11 months ago
1998
The total chromatic number zt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same colo...
GD
2007
Springer
15 years 6 months ago
2007
Springer
We show that computing the crossing number of a graph with a given rotation system is NP-complete. This result leads to a new and much simpler proof of Hlinˇen´y’s result, tha...