3204 search results - page 114 / 641 » The b-chromatic Number of a Graph |
SIROCCO
2007
13 years 11 months ago
2007
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other verti...
DAM
2010
13 years 10 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
13 years 10 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...
MFCS
2007
Springer
14 years 4 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
SODA
1993
ACM
13 years 11 months ago
1993
ACM
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...