Results 1 
4 of
4
The Splitting Number of the 4Cube
, 1998
"... The splitting number of a graph G consists in the smallest positive integer k 0, such that a planar graph can be obtained from G by k splitting operations, such operation replaces v by two nonadjacent vertices v1 and v2 , and attaches the neighbors of v either to v1 or to v2 . One of the most usef ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
The splitting number of a graph G consists in the smallest positive integer k 0, such that a planar graph can be obtained from G by k splitting operations, such operation replaces v by two nonadjacent vertices v1 and v2 , and attaches the neighbors of v either to v1 or to v2 . One of the most useful graphs in computer science is the ncube. Dean and Richter devoted an article to proving that the minimum number of crossings in an optimum drawing of the 4cube is 8, but no results about splitting number of nonplanar ncubes are known. In this note we give a proof that the splitting number of the 4cube is 4. In addition, we give the lower bound 2 n\Gamma2 for the splitting number of the ncube. In particular, because it is known that the splitting number of the ncube is O(2 n ), our result implies that the splitting number of the ncube is \Theta(2 n ).
On the Complexity of the Approximation of Nonplanarity Parameters for Cubic Graphs
, 2002
"... Let G = (V, E) be a graph. The non planar deletion problem consists in finding a smallest subset E' ⊂ E such that H = (V, E\ E') is a planar graph. The splitting number problem consists in finding the smallest integer k ≥ 0, such that a planar graph H can be defined from G b ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Let G = (V, E) be a graph. The non planar deletion problem consists in finding a smallest subset E' &sub; E such that H = (V, E\ E') is a planar graph. The splitting number problem consists in finding the smallest integer k &ge; 0, such that a planar graph H can be defined from G by k vertex splitting operations. We establish the Max SNPhardness of splitting number and non planar deletion problems for cubic graphs.
The Splitting Number and Skewness of . . .
"... The skewness of a graph G is the minimum number of edges that need to be deleted from G to produce a planar graph. The splitting number of a graph G is the minimum number of splitting steps needed to turn G into a planar graph; where each step replaces some of the edges fu; vg incident to a sele ..."
Abstract
 Add to MetaCart
The skewness of a graph G is the minimum number of edges that need to be deleted from G to produce a planar graph. The splitting number of a graph G is the minimum number of splitting steps needed to turn G into a planar graph; where each step replaces some of the edges fu; vg incident to a selected vertex u by edges fu ; vg, where u is a new vertex. We show that the splitting number of the toroidal grid graph Cn \Theta Cm is minfn; mg \Gamma 2ffi n;3 ffi m;3 \Gamma ffi n;4 ffi m;3 \Gamma ffi n;3 ffi m;4 and its skewness is minfn; mg \Gamma ffi n;3 ffi m;3 \Gamma ffi n;4 ffi m;3 \Gamma ffi n;3 ffi m;4 . Here, ffi is the Kronecker symbol, i.e., ffi i;j is 1 if i = j, and 0 if i 6= j.
SPLITTING NUMBER is NPcomplete (Extended Abstract)
"... . We consider two graph invariants that are used as a measure of nonplanarity: the splitting number of a graph and the size of a maximum planar subgraph. The splitting number of a graph G is the smallest integer k 0, such that a planar graph can be obtained from G by k splitting operations. Such op ..."
Abstract
 Add to MetaCart
. We consider two graph invariants that are used as a measure of nonplanarity: the splitting number of a graph and the size of a maximum planar subgraph. The splitting number of a graph G is the smallest integer k 0, such that a planar graph can be obtained from G by k splitting operations. Such operation replaces a vertex v by two nonadjacent vertices v1 and v2 , and attaches the neighbors of v either to v1 or to v2 . We prove that the splitting number decision problem is NPcomplete when restricted to cubic graphs. We obtain as a consequence that planar subgraph remains NPcomplete when restricted to cubic graphs. Note that NPcompleteness for cubic graphs implies NPcompleteness for graphs not containing a subdivision of K5 as a subgraph. 1 Introduction Applications in Computer Science are frequently modeled with nonplanar graphs. Graph visualization and VLSI projects many times require strategies of layout techniques. Layout algorithms are limited to special classes of graphs. Fo...