Sciweavers

342 search results - page 38 / 69
» Constrained Integer Partitions
Sort
View
ARSCOM
2007
191views more  ARSCOM 2007»
14 years 10 months ago
Binomial Identities Generated by Counting Spanning Trees
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
Thomas Dale Porter
EOR
2010
219views more  EOR 2010»
14 years 10 months ago
The Attractive Traveling Salesman Problem
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
Günes Erdogan, Jean-François Cordeau, ...
DAM
2007
141views more  DAM 2007»
14 years 9 months ago
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
JSAT
2006
73views more  JSAT 2006»
14 years 9 months ago
Impurity: Another Phase Transition of SAT
It is well known that satisfiability of random sets of propositional clauses undergoes phase transition while the clause-to-variable ratio of the sets increases. We introduce anot...
Eliezer L. Lozinskii
JCT
2002
52views more  JCT 2002»
14 years 9 months ago
A Result in Dual Ramsey Theory
We present a result which is obtained by combining a result of Carlson with the Finitary Dual Ramsey Theorem of Graham-Rothschild. We start by introducing some notation. We confor...
Lorenz Halbeisen, Pierre Matet