Sciweavers

DM
2006
93views more  DM 2006»
13 years 4 months ago
Consistency for partition regular equations
It is easy to deduce from Ramsey's Theorem that, given positive integers a1, a2, . . . , am and a finite colouring of the set N of positive integers, there exists an injectiv...
Imre Leader, Paul A. Russell
CC
2006
Springer
133views System Software» more  CC 2006»
13 years 4 months ago
The complexity of chromatic strength and chromatic edge strength
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
Dániel Marx
EJC
2008
13 years 4 months ago
Fractional chromatic number of distance graphs generated by two-interval sets
Let D be a set of positive integers. The distance graph generated by D, denoted by G(Z, D), has the set Z of all integers as the vertex Supported in part by the National Science ...
Daphne Der-Fen Liu, Xuding Zhu
DM
2008
106views more  DM 2008»
13 years 4 months ago
Chromatic capacity and graph operations
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
Jack Huizenga
DM
2008
66views more  DM 2008»
13 years 4 months ago
The Monochromatic Column problem
Let p1, p2,..., pn be a sequence of n pairwise coprime positive integers, and let P = p1p2...pn. Let 0, 1, ...,m - 1 be a sequence of m different colors. Let A be an n
Ashish K. Srivastava, Steve Szabo
ARSCOM
2008
133views more  ARSCOM 2008»
13 years 4 months ago
Eccentricity sequences and eccentricity sets in digraphs
The eccentricity e(v) of a vertex v in a strongly connected digraph G is the maximum distance from v. The eccentricity sequence of a digraph is the list of eccentricities of its v...
Joan Gimbert, Nacho López
FCT
1993
Springer
13 years 8 months ago
Generalized Topological Sorting in Linear Time
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
Torben Hagerup, Martin Maas
SPAA
2003
ACM
13 years 9 months ago
Optimal fault-tolerant linear arrays
This paper proves that for every positive integers n and k, we can explicitly construct a graph G with n+O(k) vertices and maximum degree 3, such that even after removing any k ve...
Toshinori Yamada, Shuichi Ueno
ICCS
2005
Springer
13 years 10 months ago
Disjoint Segments with Maximum Density
Given a sequence A of numbers and two positive integers and k, we study the problem to find k disjoint segments of A, each has length at least , such that their sum of densities i...
Yen Hung Chen, Hsueh-I Lu, Chuan Yi Tang