The splitting number and skewness of C-n x C-m

dc.creatorNeto, CFXD
dc.creatorSchaffer, K
dc.creatorXavier, EF
dc.creatorStolfi, J
dc.creatorFaria, L
dc.creatorde Figueiredo, CMH
dc.date2002
dc.dateAPR
dc.date2014-07-30T19:00:30Z
dc.date2015-11-26T16:55:03Z
dc.date2014-07-30T19:00:30Z
dc.date2015-11-26T16:55:03Z
dc.date.accessioned2018-03-28T23:42:19Z
dc.date.available2018-03-28T23:42:19Z
dc.identifierArs Combinatoria. Charles Babbage Res Ctr, v. 63, n. 193, n. 205, 2002.
dc.identifier0381-7032
dc.identifierWOS:000175279500017
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/72489
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/72489
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1276999
dc.descriptionThe 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 graphs where each step replaces some of the edges (u, v) incident to a selected vertex u by edges (u', v), where u' is a new vertex. V,e show that the splitting number of the toroidal grid graph C-n x C-m is min(n, m) - 2delta(n-3)delta(m,3) - delta(n,4)delta(m,3) - delta(n,3)delta(m,4) and its skewness is min(n, m) - delta(n,3)delta(m,3) - delta(n,4)delta(m,3) - delta(n,3)delta(m,4). Here, delta is the Kronecker symbol, i.e., delta(i,j) is 1 if i = j, and 0 if i not equal j.
dc.description63
dc.description193
dc.description205
dc.languageen
dc.publisherCharles Babbage Res Ctr
dc.publisherWinnipeg
dc.publisherCanadá
dc.relationArs Combinatoria
dc.relationARS Comb.
dc.rightsfechado
dc.sourceWeb of Science
dc.subjecttopological graph theory
dc.subjectgraph drawing
dc.subjecttoroidal mesh
dc.subjectplanarity
dc.subjectCrossing Number
dc.titleThe splitting number and skewness of C-n x C-m
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución