Document
type: Class

Consejo Nacional de Ciencia y Tecnología, CONACYT: 106432
type: Relationship
type: BFO_0000020
type: Entity
type: Thing
type: Grant
type: Continuant
funding vehicle for: Book drawings of complete bipartite graphs

Continuant
type: Class

Entity
type: Class

Generically Dependent Continuant
type: Class

RDF description of Book drawings of complete bipartite graphs - http://orbis.uaslp.mx/vivo/individual/scopus3972
rights: termsOfUse
date: 2026-08-27T08:32:35
publisher: vivo
type: Document

Article
type: Class

MOE2011-T2-1-090
type: Relationship
type: BFO_0000020
type: Entity
type: Thing
type: Grant
type: Continuant
funding vehicle for: Book drawings of complete bipartite graphs

Book drawings of complete bipartite graphs
e iscopus: 2-s2.0-84894412220
freetext keyword: 2-page crossing number; Book crossing number; Complete bipartite graphs; Zarankiewicz conjecture
type: Information Content Entity
related by: authorship_23210
has funding vehicle: MOE2011-T2-1-090
doi: 10.1016/j.dam.2013.11.001
type: Entity
abstract: We recall that a book with k pages consists of a straight line (the spine) and k half-planes (the pages), such that the boundary of each page is the spine. If a graph is drawn on a book with k pages in such a way that the vertices lie on the spine, and each edge is contained in a page, the result is a k-page book drawing (or simply a k-page drawing). The page number of a graph G is the minimum k such that G admits a k-page embedding (that is, a k-page drawing with no edge crossings). The k-page crossing number νk(G) of G is the minimum number of crossings in a k-page drawing of G. We investigate the page numbers andk-page crossing numbers of complete bipartite graphs. We find the exact page numbers of several complete bipartite graphs, and use these page numbers to find the exactk-page crossing number of Kk 1,n for k∈{3,4,5,6}. We also prove the general asymptotic estimate lim k→∞limn→∞νk(Kk 1,n)/(2n2/k2)=1. Finally, we give general upper bounds for νk(Km,n), and relate these bounds to the k-planar crossing numbers of Km,n and Kn. © 2013 Elsevier B.V. All rights reserved.
type: Article
abstract: We recall that a book with k pages consists of a straight line (the spine) and k half-planes (the pages), such that the boundary of each page is the spine. If a graph is drawn on a book with k pages in such a way that the vertices lie on the spine, and each edge is contained in a page, the result is a k-page book drawing (or simply a k-page drawing). The page number of a graph G is the minimum k such that G admits a k-page embedding (that is, a k-page drawing with no edge crossings). The k-page crossing number νk(G) of G is the minimum number of crossings in a k-page drawing of G. We investigate the page numbers andk-page crossing numbers of complete bipartite graphs. We find the exact page numbers of several complete bipartite graphs, and use these page numbers to find the exactk-page crossing number of Kk%2b1,n for k∈{3,4,5,6}. We also prove the general asymptotic estimate lim k→∞limn→∞νk(Kk%2b 1,n)/(2n2/k2)=1. Finally, we give general upper bounds for νk(Km,n), and relate these bounds to the k-planar crossing numbers of Km,n and Kn. © 2013 Elsevier B.V. All rights reserved.
type: Continuant
page start: 80
related by: authorship_23209
page end: 93
volume: 167
has publication venue: Discrete Applied Mathematics
type: Generically Dependent Continuant
has funding vehicle: Consejo Nacional de Ciencia y Tecnología, CONACYT: 106432
accesstype: All Open Access, Green
type: Thing
origen: scopus
related by: authorship_23208
estado: published
most specific type: Article
most specific type: Document
type: Document
crisid: 3973
date time value: article date 3973

Information Content Entity
type: Class

Discrete Applied Mathematics
type: Entity
type: Collection
publication venue for: Book drawings of complete bipartite graphs
type: Journal
type: Periodical
type: Thing
type: Information Content Entity
type: Continuant
type: Generically Dependent Continuant
type: Document