Which crossing number is it anyway?
type: Item
instance of: scholarly article
title: Which crossing number is it anyway?
zbMATH Open document ID: 1023.05042
author: János Pach
author: Géza Tóth
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 1843728
zbMATH Keywords: drawing
MaRDI profile type: Publication
full work available at URL: jctb.2000.1978
OpenAlex ID: W2003689202
Wikidata QID: Q56853080
cites work: Crossing-Free Subgraphs
cites work: A framework for solving VLSI graph layout problems
cites work: Some provably hard crossing number problems
cites work: New results on rectilinear crossing numbers and plane embeddings
cites work: Bounds for rectilinear crossing numbers
cites work: Q5422499
cites work: Bounds for generalized thrackles
cites work: Über wesentlich unplättbare Kurven im dreidimensionalen Raume
cites work: Q5786239
cites work: Crossing Number is NP-Complete
cites work: Some simplified NP-complete graph problems
cites work: Q5587734
cites work: An upper bound for the rectilinear crossing number of the complete graph
cites work: New lower bound techniques for VLSI
cites work: On Conway's thrackle conjecture
cites work: Graphs drawn with few crossings per edge
cites work: Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
cites work: Q4352316
cites work: Toward a theory of crossing numbers
cites work: Q3661495
DOI: 10.1006/JCTB.2000.1978
description: scientific article; zbMATH DE number 1843728