686 search results - page 58 / 138 » Packing Cycles in Graphs |
96
Voted
FSTTCS
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. This paper addresses the state explosion problem in automata based LTL model checking. To deal with large space requirements we turn to use a distributed approach. All th...
102
Voted
CCCG
2008
15 years 1 months ago
2008
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...
JCT
2008
15 years 14 days ago
2008
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
DM
1998
15 years 5 days ago
1998
The problem of the existence of an alternating simple dicycle in a 2-arc-coloured digraph is considered. This is a generalization of the alternating cycle problem in 2-edgecoloure...
COMBINATORICS
1999
15 years 5 days ago
1999
![A [k, k+1]-Factor Containing A Given Hamiltonian Cycle](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/a_k_k_1_factor_containing_a_given_hamiltonian_cycle_COMBINATORICS_1999.jpg "A [k, k+1]-Factor Containing A Given Hamiltonian Cycle")
We prove the following best possible result. Let k 2 be an integer and G be a graph of order n with minimum degree at least k. Assume n 8k - 16 for even n and n 6k-13 for odd n...