643 search results - page 100 / 129 » Supereulerian planar graphs |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
EJC
2010
13 years 7 months ago
2010
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
COMGEO
2007
ACM
13 years 7 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...
ECCC
2010
13 years 5 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
TIP
2008
13 years 7 months ago
2008
We introduce a graph Laplacian based algorithm for the tomography reconstruction of a planar object from its projections taken at random unknown directions. The algorithm is shown ...