54 search results - page 3 / 11 » Coloring Subgraphs of the Rado Graph |
COMBINATORICA
2007
13 years 8 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 ...
EJC
2007
13 years 8 months ago
2007
TCS
2011
13 years 3 months ago
2011
ISCAS
2003
IEEE
14 years 1 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...
RSA
2011
13 years 3 months ago
2011
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...