50 search results - page 2 / 10 » Colorful subgraphs in Kneser-like graphs |
COMBINATORICA
2007
13 years 5 months ago
2007
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 ...
COMBINATORICA
2006
13 years 5 months ago
2006
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...
EJC
2007
13 years 5 months ago
2007
TCS
2011
13 years 14 days ago
2011
ISCAS
2003
IEEE
13 years 10 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...