Document
type: Class

Stars and Bonds in Crossing-Critical Graphs
type: Generically Dependent Continuant
type: Thing
abstract: The structure of all known infinite families of crossing-critical graphs has led to the conjecture that crossing-critical graphs have bounded bandwidth. If true, this would imply that crossing-critical graphs have bounded degree, that is, that they cannot contain subdivisions of K1, n for arbitrarily large n. In this paper we prove two results that revolve around this conjecture. On the positive side, we show that crossing-critical graphs cannot contain subdivisions of K2, n for arbitrarily large n. On the negative side, we show that there are graphs with arbitrarily large maximum degree that are 2-crossing-critical in the projective plane. © 2008 Elsevier B.V. All rights reserved.
type: Article
has publication venue: Electronic Notes in Discrete Mathematics
issue: C
related by: authorship_12532
crisid: 2111
estado: published
type: Information Content Entity
page start: 271
most specific type: Document
type: Document
e iscopus: 2-s2.0-48549096453
doi: 10.1016/j.endm.2008.06.055
type: Continuant
most specific type: Article
origen: scopus
page end: 275
type: Entity
accesstype: All Open Access, Green
related by: authorship_12531
date time value: article date 2111
volume: 31
freetext keyword: bandwidth; bounded degree; crossing number; crossing-critical graph

Electronic Notes in Discrete Mathematics
type: Information Content Entity
type: Entity
type: Collection
type: Continuant
type: Thing
type: Generically Dependent Continuant
type: Periodical
publication venue for: Stars and Bonds in Crossing-Critical Graphs
type: Document
type: Journal

Continuant
type: Class

Entity
type: Class

Generically Dependent Continuant
type: Class

RDF description of Stars and Bonds in Crossing-Critical Graphs - http://orbis.uaslp.mx/vivo/individual/scopus2110
rights: termsOfUse
date: 2026-08-27T08:34:59
publisher: vivo
type: Document

Article
type: Class

Information Content Entity
type: Class