Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
TCS
2008
10 years 3 months ago
Paths and trails in edge-colored graphs
This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...
A. Abouelaoualim, Kinkar Chandra Das, L. Faria, Ya...
JGT
2006
92views more  JGT 2006»
10 years 4 months ago
Characterization of edge-colored complete graphs with properly colored Hamilton paths
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...
Jinfeng Feng, Hans-Erik Giesen, Yubao Guo, Gregory...
COMBINATORICS
2006
89views more  COMBINATORICS 2006»
10 years 4 months ago
Rainbow H-factors
An H-factor of a graph G is a spanning subgraph of G whose connected components are isomorphic to H. Given a properly edge-colored graph G, a rainbow H-subgraph of G is an H-subgr...
Raphael Yuster
books