Name
Abstract | ||
|---|---|---|
. The splitting number of a graph G consists in the smallestpositive integer k 0, such that a planar graph can be obtained from Gby k splitting operations, such operation replaces v by two nonadjacentvertices 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 n--cube. Deanand Richter devoted an article to proving that the minimum number ofcrossings in an optimum drawing of the 4--cube is 8, but no results about... |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/BFb0054317 | LATIN |
Keywords | Field | DocType |
splitting number,planar graph | Graph theory,Integer,Complete bipartite graph,Discrete mathematics,Combinatorics,Vertex (geometry),Upper and lower bounds,Cubic graph,Planar graph,Mathematics,Cube | Conference |
Volume | ISSN | ISBN |
1380 | 0302-9743 | 3-540-64275-7 |
Citations | PageRank | References |
2 | 0.46 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luerbio Faria | 1 | 133 | 20.98 |
| Celina M. Herrera de Figueiredo | 2 | 9 | 2.67 |
| Candido Ferreira Xavier de Mendonça Neto | 3 | 17 | 4.33 |