Sciweavers

686 search results - page 13 / 138
» Packing Cycles in Graphs
Sort
View
TCS
2010
14 years 7 months ago
A comprehensive analysis of degree based condition for Hamiltonian cycles
— 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...
Md. Kamrul Hasan, Mohammad Kaykobad, Young-Koo Lee...
ARSCOM
2004
104views more  ARSCOM 2004»
14 years 9 months ago
Complete Minors in Cubic Graphs with few short Cycles and Random Cubic Graphs
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this the...
Klas Markstrom
STOC
2004
ACM
73views Algorithms» more  STOC 2004»
15 years 9 months ago
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree:
Jonathan A. Kelner
86
Voted
COMBINATORICA
2004
127views more  COMBINATORICA 2004»
14 years 9 months ago
On Infinite Cycles I
We extend the basic theory concerning the cycle space of a finite graph to infinite locally finite graphs, using as infinite cycles the homeomorphic images of the unit circle in t...
Reinhard Diestel, Daniela Kühn
RSA
2000
149views more  RSA 2000»
14 years 9 months ago
Hamilton cycles in random graphs and directed graphs
Colin Cooper, Alan M. Frieze