KIVS

2011

Springer

12 years 5 months ago
2011

Springer

Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...

ESA

2010

Springer

13 years 26 days ago
2010

Springer

Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...

COCOA

2010

Springer

13 years 26 days ago
2010

Springer

A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. A rooted plane graph has a designated outer vertex. For given positive integers ...

GC

2010

Springer

13 years 1 months ago
2010

Springer

In 1988, Seiya Negami published a conjecture stating that a graph G has a ﬁnite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...

CORR

1999

Springer

13 years 2 months ago
1999

Springer

We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...

JGAA

2002

13 years 2 months ago
2002

We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...

CORR

2002

Springer

13 years 2 months ago
2002

Springer

Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the ...

COMBINATORICS

2000

13 years 2 months ago
2000

In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...

COMGEO

2004

ACM

13 years 2 months ago
2004

ACM

We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...

COMBINATORICS

2004

13 years 2 months ago
2004

The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...