202 search results - page 24 / 41 » On the Queue Number of Planar Graphs |
157
click to vote
COMGEO
2007
ACM
15 years 3 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...
123
click to vote
ATMOS
2010
15 years 2 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
140
Voted
JGT
2008
15 years 3 months ago
2008
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....
119
click to vote
ICIP
2002
IEEE
16 years 5 months ago
2002
IEEE
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs...
157
click to vote
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....