Sciweavers

1633 search results - page 43 / 327
» Planar Map Graphs
Sort
View
TPHOL
2002
IEEE
14 years 1 months ago
The 5 Colour Theorem in Isabelle/Isar
Based on an inductive definition of triangulations, a theory of undirected planar graphs is developed in Isabelle/HOL. The proof of the 5 colour theorem is discussed in some detai...
Gertrud Bauer, Tobias Nipkow
CCCG
2010
13 years 10 months ago
Regular labelings and geometric structures
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...
David Eppstein
CORR
2010
Springer
145views Education» more  CORR 2010»
13 years 9 months ago
CAT-generation of ideals
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
Torsten Ueckerdt
ISAAC
2007
Springer
120views Algorithms» more  ISAAC 2007»
14 years 3 months ago
Succinct Representation of Labeled Graphs
Abstract. We consider the problem of designing succinct representations of labeled graphs (we consider vertex labeled planar triangulations, as well as edge labeled planar graphs a...
Jérémy Barbay, Luca Castelli Aleardi...
COMPGEOM
2003
ACM
14 years 2 months ago
Planar minimally rigid graphs and pseudo-triangulations
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
Ruth Haas, David Orden, Günter Rote, Francisc...