Sciweavers

5 search results - page 1 / 1
» On Oriented Arc-Coloring of Subcubic Graphs
Sort
View
COMBINATORICS
2006
183views more  COMBINATORICS 2006»
13 years 4 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
IPL
2006
153views more  IPL 2006»
13 years 4 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
ENDM
2007
149views more  ENDM 2007»
13 years 4 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
DM
2006
121views more  DM 2006»
13 years 4 months ago
The acircuitic directed star arboricity of subcubic graphs is at most four
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented grap...
Alexandre Pinlou, Eric Sopena
DAM
2011
12 years 11 months ago
A study of 3-arc graphs
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph ...
Martin Knor, Guangjun Xu, Sanming Zhou