388 search results - page 42 / 78 » On the Number of Cycles in Planar Graphs |
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
COMGEO
2007
ACM
13 years 7 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
SCAM
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper presents and evaluates a number of techniques to improve the execution time of interprocedural pointer analysis in the context of large C programs. The analysis is form...
FSTTCS
2001
Springer
14 years 10 days 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...
COMBINATORICS
1999
13 years 7 months 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...