Crossing number for graphs with bounded pathwidth
type: Item
instance of: scholarly article
title: Crossing number for graphs with bounded pathwidth
zbMATH Open document ID: 1433.68280
author: Markus Chimani
author: Martin Derka
author: Therese Biedl
author: Petra Mutzel
published in: Algorithmica
publication date: 2020-04-09T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8257/
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7188815
zbMATH Keywords: crossing number
zbMATH Keywords: pathwidth
zbMATH Keywords: approximation
zbMATH Keywords: graph algorithms
zbMATH Keywords: complexity
MaRDI profile type: Publication
OpenAlex ID: W3000010299
cites work: Crossing-Free Subgraphs
cites work: Q5136229
cites work: Some provably hard crossing number problems
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
cites work: On the crossing numbers of Cartesian products with paths
cites work: Hardness of approximation for crossing number
cites work: Crossing number and weighted crossing number of near-planar graphs
cites work: Q3132864
cites work: Vertex insertion approximates the crossing number of apex graphs
cites work: An algorithm for the graph crossing number problem
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Improved Bounds for the Crossing Numbers of Km,n and Kn
cites work: How to draw a planar graph on a grid
cites work: Approximating the Rectilinear Crossing Number
cites work: The crossing number of a projective graph is quadratic in the face-width
cites work: Computing crossing numbers in quadratic time
cites work: Crossing-number critical graphs have bounded path-width
cites work: Q5417677
cites work: Approximating the Crossing Number of Toroidal Graphs
cites work: Q3549636
cites work: The crossing number of K5,n
cites work: The crossing numbers of products of path with graphs of order six
cites work: Treewidth. Computations and approximations
cites work: The crossing number of K11 is 100
cites work: The crossing number of \(P(N,3)\)
cites work: Q3138887
cites work: Planar decompositions and the crossing number of graphs with an excluded minor
Wikidata QID: Q126378314
DOI: 10.1007/S00453-019-00653-X
Recommended article: Q5136229
Recommended article: Crossing-number critical graphs have bounded path-width
Recommended article: Q3043709
Recommended article: Q3015640
Recommended article: Crossing Numbers of Graphs
Recommended article: The Crossing Number of Graphs: Theory and Computation
Recommended article: Crossing numbers of beyond-planar graphs
Recommended article: Crossing number and weighted crossing number of near-planar graphs
Recommended article: Crossing and Weighted Crossing Number of Near-Planar Graphs
description: scientific article; zbMATH DE number 7188815