184 search results - page 16 / 37 » On the Quantum Chromatic Number of a Graph |
JCT
2008
14 years 11 months ago
2008
This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and he...
DAM
2010
14 years 11 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
JGT
2008
14 years 11 months ago
2008
The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, the...
127
click to vote
ALGORITHMICA
2002
14 years 11 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
112
click to vote
ENDM
2007
14 years 11 months ago
2007
d Abstract) Pascal Ochem∗, Alexandre Pinlou† LaBRI, Université Bordeaux 1, 351, Cours de la Libération, 33405 Talence Cedex, France March 16, 2007 A homomorphism from an ori...