6740 search results - page 492 / 1348 » An s -Hamiltonian Line Graph Problem |
176
click to vote
RANDOM
1998
Springer
15 years 11 months ago
1998
Springer
There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Fri...
151
click to vote
DAM
2008
15 years 7 months ago
2008
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
145
click to vote
DM
2006
15 years 6 months ago
2006
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...
173
click to vote
JCT
2006
15 years 6 months ago
2006
MacLane's planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B....
149
click to vote
PAMI
2006
15 years 6 months ago
2006
Spectral graph partitioning provides a powerful approach to image segmentation. We introduce an alternate idea that finds partitions with a small isoperimetric constant, requiring ...