Sciweavers

CPC
2011
189views Education» more  CPC 2011»
13 years 5 months ago
A Counter-Intuitive Correlation in a Random Tournament
Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertices in V . We study the correlation between the events {a → s} and {s → b}. We show that...
Sven Erick Alm, Svante Linusson
ENDM
2007
149views more  ENDM 2007»
13 years 10 months ago
Oriented vertex and arc colorings of partial 2-trees
d Abstract) Pascal Ochem∗, Alexandre Pinlou† LaBRI, Université Bordeaux 1, 351, Cours de la Libération, 33405 Talence Cedex, France March 16, 2007 A homomorphism from an ori...
Pascal Ochem, Alexandre Pinlou
JGT
2008
97views more  JGT 2008»
13 years 10 months ago
On the oriented chromatic index of oriented graphs
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
Pascal Ochem, Alexandre Pinlou, Eric Sopena
IPL
2006
153views more  IPL 2006»
13 years 10 months ago
Oriented vertex and arc colorings of outerplanar graphs
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping from V (G) to V (H), that is (x)(y) is an arc in H whenever xy is an arc in G. The orie...
Alexandre Pinlou, Eric Sopena
IPL
2008
169views more  IPL 2008»
13 years 10 months ago
Oriented colorings of partial 2-trees
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(y) is an arc in H whenever xy is an arc in G. The or...
Pascal Ochem, Alexandre Pinlou
DM
2006
86views more  DM 2006»
13 years 10 months ago
Decomposing oriented graphs into transitive tournaments
For an oriented graph G with n vertices, let f(G) denote the minimum number of transitive subtournaments that decompose G. We prove several results on f(G). In particular, if G is...
Raphael Yuster
COMBINATORICS
2006
183views more  COMBINATORICS 2006»
13 years 11 months ago
On Oriented Arc-Coloring of Subcubic Graphs
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that -----(u)(v) is an arc in H whenever...
Alexandre Pinlou
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...
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 11 months ago
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
Eric Sopena