Sciweavers

Share
12 search results - page 1 / 3
» Bounded-Degree Graphs can have Arbitrarily Large Slope Numbe...
Sort
View
COMBINATORICS
2006
134views more  COMBINATORICS 2006»
9 years 12 months ago
Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers
János Pach, Dömötör Pá...
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
9 years 12 months ago
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
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...
János Barát, Jirí Matousek, D...
COMGEO
2007
ACM
9 years 12 months ago
Graph drawings with few slopes
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...
Vida Dujmovic, Matthew Suderman, David R. Wood
CORR
2006
Springer
128views Education» more  CORR 2006»
9 years 12 months ago
The Shannon capacity of a graph and the independence numbers of its powers
The independence numbers of powers of graphs have been long studied, under several definitions of graph products, and in particular, under the strong graph product. We show that t...
Noga Alon, Eyal Lubetzky
ICALP
2011
Springer
9 years 3 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
books