The circular $k$-partite crossing number of $K_{m,n}$

Simple item page
dc.creatorRiskin, Adrian
dc.date2006-05-09
dc.date.accessioned2026-07-07T08:07:47Z
dc.date.available2026-07-07T08:07:47Z
dc.descriptionWe define a new kind of crossing number which generalizes both the bipartite crossing number and the outerplanar crossing number. We calculate exact values of this crossing number for many complete bipartite graphs and also give a lower bound.
dc.identifierhttps://arxiv.org/abs/math/0605235
dc.identifierhttp://arxiv.org/abs/math/0605235
dc.identifierAustralasian J. Combin. 38(2007) pp. 207-210
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131046
dc.subjectCombinatorics
dc.subject05C10
dc.titleThe circular $k$-partite crossing number of $K_{m,n}$
dc.typetext

Files

Collections

arXiv