718 search results - page 33 / 144 » Coloring quasi-line graphs |
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
ALGORITHMICA
2010
14 years 11 months ago
2010
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
APAL
1998
14 years 11 months ago
1998
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...
COMBINATORICS
2000
14 years 11 months ago
2000
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...