Sciweavers

388 search results - page 16 / 78
» On the Number of Cycles in Planar Graphs
Sort
View
COMPGEOM
2009
ACM
14 years 2 months ago
Minimum cuts and shortest homologous cycles
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
GC
2010
Springer
13 years 6 months ago
Integer Functions on the Cycle Space and Edges of a Graph
A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the n...
Daniel C. Slilaty
COMBINATORICS
2004
82views more  COMBINATORICS 2004»
13 years 7 months ago
Decomposing Infinite 2-Connected Graphs into 3-Connected Components
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
R. Bruce Richter
DM
2007
103views more  DM 2007»
13 years 7 months ago
Minimum cycle bases of graphs on surfaces
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
Han Ren, Mo Deng
WG
2010
Springer
13 years 6 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski