2310 search results - page 52 / 462 » Coloring Random Graphs |
EJC
2006
13 years 9 months ago
2006
An n-lift of a graph K, is a graph with vertex set V (K)
ESA
2006
Springer
14 years 21 days ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
CC
2006
Springer
13 years 9 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
PPAM
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...