Join Our Newsletter

CPM

2011

Springer

11 years 5 months ago
2011

Springer

Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...

SIAMDM

2010

11 years 8 months ago
2010

Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...

CORR

2010

Springer

11 years 11 months ago
2010

Springer

We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...

SSPR

2010

Springer

11 years 11 months ago
2010

Springer

Abstract. In order to use structural techniques from graph-based pattern recognition, a first necessary step consists in extracting a graph in an automatic way from an image. We pr...

ESA

2010

Springer

11 years 11 months 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

11 years 11 months 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 ...

JGT

2007

12 years 1 months ago
2007

A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...

DAM

2007

12 years 1 months ago
2007

In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...

CCCG

2010

12 years 3 months ago
2010

d Abstract) Debajyoti Mondal , Rahnuma Islam Nishat , Md. Saidur Rahman , and Muhammad Jawaherul Alam

ISAAC

2005

Springer

12 years 7 months ago
2005

Springer

Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as ﬁve points evenly placed on the ci...