720 search results - page 23 / 144 » Nonrepetitive colorings of graphs |
BMCBI
2011
13 years 2 months ago
2011
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
ICANNGA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
ESA
2004
Springer
14 years 28 days ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
DAM
2008
13 years 7 months ago
2008
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their definition by means of a more general coloring concept, on the other hand as an i...