Sciweavers

ENDM
2008
114views more  ENDM 2008»
13 years 11 months ago
Strong oriented chromatic number of planar graphs without cycles of specific lengths
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
Mickaël Montassier, Pascal Ochem, Alexandre P...
ENDM
2008
94views more  ENDM 2008»
13 years 11 months ago
List Colouring Constants of Triangle Free Graphs
Omid Amini, Bruce A. Reed
ENDM
2008
118views more  ENDM 2008»
13 years 11 months ago
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
Flavia Bonomo, Guillermo Durán, Francisco J...
ENDM
2008
82views more  ENDM 2008»
13 years 11 months ago
Finding Folkman Numbers via MAX CUT Problem
In this note we report on our recent work, still in progress, regarding Folkman numbers. Let f(2, 3, 4) denote the smallest integer n such that there exists a K4
Andrzej Dudek, Vojtech Rödl
ENDM
2008
61views more  ENDM 2008»
13 years 11 months ago
Partial Characterizations of Circular-Arc Graphs
Flavia Bonomo, Guillermo Durán, Luciano N. ...
ENDM
2008
81views more  ENDM 2008»
13 years 11 months ago
The maximum number of halving lines and the rectilinear crossing number of Kn for n
For n 27 we present exact values for the maximum number h(n) of halving lines and h(n) of halving pseudolines, determined by n points in the plane. For this range of values of n ...
Bernardo M. Ábrego, Silvia Fernández...
ENDM
2008
101views more  ENDM 2008»
13 years 11 months ago
A central approach to bound the number of crossings in a generalized configuration
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...
Bernardo M. Ábrego, Silvia Fernández...
ENDM
2008
62views more  ENDM 2008»
13 years 11 months ago
Nowhere-zero 5-flows and (1, 2)-factors
Martín Matamala, José Zamora
ENDM
2008
82views more  ENDM 2008»
13 years 11 months ago
Repetition-free longest common subsequence
We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a...
Said Sadique Adi, Marília D. V. Braga, Cris...
ENDM
2008
53views more  ENDM 2008»
13 years 11 months ago
A robust P2P streaming architecture and its application to a high quality live-video service
Héctor Cancela, Franco Robledo Amoza, Pablo...