6413 search results - page 1 / 1283 » Classes of cycle bases |
COMBINATORICS
2000
13 years 4 months ago
2000
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
DAM
2007
13 years 4 months ago
2007
FSE
2005
Springer
13 years 10 months ago
2005
Springer
T-function is a relatively new cryptographic building block suitable for streamciphers. It has the potential of becoming a substitute for LFSRs, and those that correspond to maximu...
TCS
2010
13 years 3 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
GC
2008
Springer
13 years 4 months ago
2008
Springer
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...