DMTCS
2010
13 years 1 months ago
2010
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of S...
WG
2010
Springer
13 years 2 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
RSA
2010
13 years 3 months ago
2010
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...
JDA
2010
13 years 3 months ago
2010
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
GC
2010
Springer
13 years 3 months ago
2010
Springer
In 1966 Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar g...
ATMOS
2010
13 years 3 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...
SIAMCOMP
1998
13 years 4 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
GC
2002
Springer
13 years 4 months ago
2002
Springer
The main result of the papzer is that any planar graph with odd girth at least 10k
ALGORITHMICA
2004
13 years 4 months ago
2004
Eppstein [5] characterized the minor-closed graph families for which the treewidth is bounded by a function of the diameter, which includes e.g. planar graphs. This characterizatio...
JCT
2007
13 years 4 months ago
2007
We conjecture that every planar graph of odd-girth 2k + 1 admits a homomorphism to Cayley graph C(Z2k+1 2 , S2k+1), with S2k+1 being the set of (2k + 1)vectors with exactly two co...