601 search results - page 5 / 121 » Edge-dominating cycles in graphs |
108
Voted
JGT
2010
14 years 8 months ago
2010
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose
80
Voted
WG
2010
Springer
14 years 8 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
106
Voted
JCT
2010
14 years 8 months ago
2010
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...
78
Voted
GC
2002
Springer
14 years 10 months ago
2002
Springer
We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even...
64
Voted
JGT
2010
14 years 8 months ago
2010
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we...