43 search results - page 1 / 9 » Cycles of given length in oriented graphs |
JCT
2010
14 years 8 months ago
2010
95
Voted
GC
2008
Springer
14 years 10 months ago
2008
Springer
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
92
Voted
ENDM
2008
14 years 10 months ago
2008
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...
64
Voted
JGT
2010
14 years 8 months ago
2010
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we...
121
Voted
COMGEO
2012
ACM
13 years 6 months ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...