Graphs drawn with few crossings per edge
From MaRDI portal
Publication:1272189
DOI10.1007/BF01215922zbMath0902.05017WikidataQ56001341 ScholiaQ56001341MaRDI QIDQ1272189
Publication date: 24 November 1998
Published in: Combinatorica (Search for Journal in Brave)
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Radial points in the plane, Crossing patterns of segments, On the maximum number of edges in quasi-planar graphs, A branch-and-cut approach to the crossing number problem, Crossing-number critical graphs have bounded path-width, A successful concept for measuring non-planarity of graphs: The crossing number., Which crossing number is it anyway?, Geometric graphs with no self-intersecting path of length three, Topological graphs with no large grids
Cites Work