721 search results - page 17 / 145 » Bounds on the k-domination number of a graph |
129
click to vote
GD
2008
Springer
15 years 3 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
115
click to vote
GD
2003
Springer
15 years 7 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
145
click to vote
GC
2002
Springer
15 years 1 months ago
2002
Springer
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
118
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
254
click to vote
ECCC
2011
14 years 9 months ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...