2314 search results - page 79 / 463 » Minimal Partitions of a Graph |
82
Voted
JGT
2010
15 years 1 months ago
2010
. Dirac. Some theorems on abstract graphs. Proc. London Math. Soc. (3), 2:69–81, 1952. [2] Hikoe Enomoto and Katsuhiro Ota. Partitions of a graph into paths with prescribed endve...
COMBINATORICS
2007
15 years 3 months ago
2007
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
110
Voted
SIAMCOMP
2000
15 years 3 months ago
2000
We consider a system of uniform recurrence equations (URE) of dimension one. We show how its computation can be carried out using minimal memory size with several synchronous proc...
124
Voted
EVOW
2010
Springer
15 years 8 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
122
Voted
ARSCOM
2004
15 years 3 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...