102 search results - page 1 / 21 » Colored graphs without colorful cycles |
98
Voted
COMBINATORICA
2007
15 years 13 days 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 ...
DM
2010
15 years 15 days ago
2010
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...
113
Voted
CORR
2007
Springer
15 years 12 days ago
2007
Springer
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...
73
Voted
JCT
2006
15 years 12 days ago
2006
96
Voted
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...