641 search results - page 90 / 129 » On Planar Quasi-Parity Graphs |
CCCG
2007
15 years 1 months ago
2007
We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a tr...
103
click to vote
CCCG
2003
15 years 1 months ago
2003
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G for...
DIAGRAMS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This paper shows by a constructive method the existence of a diagrammatic representation called extended Euler diagrams for any collection of sets X1, ..., Xn , n < 9....
GD
2008
Springer
15 years 29 days ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
113
click to vote
LATA
2009
Springer
15 years 6 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...