Sciweavers

266 search results - page 51 / 54
» Chromatic Ramsey numbers
Sort
View
DM
2008
112views more  DM 2008»
13 years 7 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd
JCT
2007
111views more  JCT 2007»
13 years 7 months ago
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...
David Forge, Thomas Zaslavsky
NETWORKS
2010
13 years 5 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
TOMS
2010
106views more  TOMS 2010»
13 years 5 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
ICIP
2009
IEEE
13 years 5 months ago
New image processing challenges for jointly designed electro-optical imaging systems
Still-image processing algorithms are tailored to and depend crucially upon the properties of the class of images to which they are applied, for instance natural images in consumer...
M. Dirk Robinson, David G. Stork