Sciweavers

COMBINATORICA
2007
148views more  COMBINATORICA 2007»
13 years 11 months ago
Colored graphs without colorful cycles
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
Richard N. Ball, Ales Pultr, Petr Vojtechovsk&yacu...