686 search results - page 24 / 138 » Packing Cycles in Graphs |
112
click to vote
DM
2008
15 years 13 days ago
2008
A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...
GC
2007
Springer
15 years 9 days ago
2007
Springer
Let Γ be a finite digraph and let G be a subgroup of the automorphism group of Γ. A directed cycle C of Γ is called G-consistent whenever there is an element of G whose restri...
88
Voted
CPC
2008
15 years 13 days ago
2008
In 1998 Luczak, R
109
Voted
SIROCCO
2001
15 years 1 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
96
Voted
SIAMDM
2008
14 years 11 months ago
2008
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable co...