Results

**1 - 4**of**4**### CONTENTS CONTENTS

, 2010

"... In this paper we present the maximum flow algorithm in O(n log n) for directed planar graphs of Glencore Borradail and Philip Klein published in 2009 in [1]. Further we are going to present and analyse an implementation of this algorithm. To analyse the maximum flow algorithm we also use an algorith ..."

Abstract
- Add to MetaCart

In this paper we present the maximum flow algorithm in O(n log n) for directed planar graphs of Glencore Borradail and Philip Klein published in 2009 in [1]. Further we are going to present and analyse an implementation of this algorithm. To analyse the maximum flow algorithm we also use an algorithm to find the maximal running time of a an algorithm for planar graphs which is based on trans-forming maximal planar graphs to other maximal planar graphs by Lawson flips. This algorithm will be presented and analyzed as well.

### ON CYCLIC EDGE-CONNECTIVITY OF FULLERENES

, 2007

"... A graph is said to be cyclic k-edge-connected, if at least k edges must be removed to disconnect it into two components, each containing a cycle. Such a set of k edges is called a cyclic-k-edge cutset and it is called a trivial cyclic-k-edge cutset if at least one of the resulting two components ind ..."

Abstract
- Add to MetaCart

(Show Context)
A graph is said to be cyclic k-edge-connected, if at least k edges must be removed to disconnect it into two components, each containing a cycle. Such a set of k edges is called a cyclic-k-edge cutset and it is called a trivial cyclic-k-edge cutset if at least one of the resulting two components induces a single k-cycle. It is known that fullerenes, that is, 3-connected cubic planar graphs all of whose faces are pentagons and hexagons, are cyclic 5-edge-connected. In this article it is shown that a fullerene F containing a nontrivial cyclic-5-edge cutset admits two antipodal pentacaps, that is, two antipodal pentagonal faces whose neighboring faces are also pentagonal. Moreover, it is n ⌊ shown that F has a Hamilton cycle, and as a consequence at least 15 ·2 20 ⌋ perfect matchings, where n is the order of F.

### CONTENTS

"... In this paper we present the maximum flow algorithm in O(n log n) for directed planar graphs of Glencore Borradail and Philip Klein published in 2009 in [1]. Further we are going to present and analyse an implementation of this algorithm. To analyse the maximum flow algorithm we also use an algorith ..."

Abstract
- Add to MetaCart

In this paper we present the maximum flow algorithm in O(n log n) for directed planar graphs of Glencore Borradail and Philip Klein published in 2009 in [1]. Further we are going to present and analyse an implementation of this algorithm. To analyse the maximum flow algorithm we also use an algorithm to find the maximal running time of a an algorithm for planar graphs which is based on transforming maximal planar graphs to other maximal planar graphs by Lawson flips.

### Recursive generation of simple planar 5-regular graphs and pentangulations

- JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS
, 2011

"... ..."

(Show Context)