3211 search results - page 103 / 643 » On the Grundy Number of a Graph |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is relate...
DM
2010
13 years 10 months ago
2010
A graph G is loosely-c-connected, or -c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite co...
DM
2008
13 years 9 months ago
2008
We study graph colorings avoiding periodic sequences with large number of blocks on paths. The main problem is to decide, for a given class of graphs F, if there are absolute const...
SODA
2012
ACM
12 years 18 days ago
2012
ACM
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
DSD
2003
IEEE
14 years 3 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...