243 search results - page 10 / 49 » Listing All Plane Graphs |
COMBINATORICS
2006
14 years 10 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
106
click to vote
COMGEO
2007
ACM
14 years 10 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
CP
2006
Springer
15 years 3 days ago
2006
Springer
Abstract. This report presents a generic filtering scheme, based on the graph description of global constraints. This description is defined by a network of binary constraints and ...
DCG
2010
14 years 10 months ago
2010
Consider a graph G with n vertices. In this paper we study geometric conditions for an n-tuple of points in Rd to admit a non-zero self stress with underlying graph G. We introduce...
TALG
2008
14 years 10 months ago
2008
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in