Graphs drawn with few crossings per edge
From MaRDI portal
Publication:1272189
DOI10.1007/BF01215922zbMath0902.05017OpenAlexW1723997437WikidataQ56001341 ScholiaQ56001341MaRDI QIDQ1272189
Publication date: 24 November 1998
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01215922
Related Items (only showing first 100 items - show all)
The density of fan-planar graphs ⋮ The Szemerédi-Trotter theorem in the complex plane ⋮ Space Crossing Numbers ⋮ Geometric graphs with no self-intersecting path of length three ⋮ Outer 1-planar graphs ⋮ Recognizing and drawing IC-planar graphs ⋮ On graphs, which can be drawn on an orientable surface with small number of intersections on an edge ⋮ Facial list colourings of plane graphs ⋮ A survey on book-embedding of planar graphs ⋮ Iterated point-line configurations grow doubly-exponentially ⋮ Edge-minimum saturated \(k\)-planar drawings ⋮ Simplifying non-simple fan-planar drawings ⋮ Recognizing and embedding simple optimal 2-planar graphs ⋮ Area requirement of graph drawings with few crossings per edge ⋮ The crossing number of twisted graphs ⋮ On RAC drawings of 1-planar graphs ⋮ Dynamic list coloring of 1-planar graphs ⋮ On quasi-planar graphs: clique-width and logical description ⋮ An annotated bibliography on 1-planarity ⋮ On topological graphs with at most four crossings per edge ⋮ On the maximum number of edges in quasi-planar graphs ⋮ \((k,p)\)-planarity: a relaxation of hybrid planarity ⋮ On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ The book thickness of 1-planar graphs is constant ⋮ A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system ⋮ Crossings between non-homotopic edges ⋮ Proper 1-immersions of graphs triangulating the plane ⋮ On drawings and decompositions of 1-planar graphs ⋮ Right Angle Crossing Graphs and 1-Planarity ⋮ A note on 1-planar graphs ⋮ The structure of plane graphs with independent crossings and its applications to coloring problems ⋮ 1-planarity of complete multipartite graphs ⋮ Crossing-number critical graphs have bounded path-width ⋮ On the Size of Planarly Connected Crossing Graphs ⋮ Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time ⋮ On the Density of Non-simple 3-Planar Graphs ⋮ Stack and Queue Layouts via Layered Separators ⋮ On the edge crossing properties of Euclidean minimum weight Laman graphs ⋮ A note on odd colorings of 1-planar graphs ⋮ Note on \(k\)-planar crossing numbers ⋮ Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs ⋮ On crossing numbers of geometric proximity graphs ⋮ Recognizing optimal 1-planar graphs in linear time ⋮ Drawing graphs using a small number of obstacles ⋮ On an extremal problem in the class of bipartite 1-planar graphs ⋮ Right angle crossing graphs and 1-planarity ⋮ A PTAS for the Cluster Editing Problem on Planar Graphs ⋮ Efficient generation of different topological representations of graphs beyond-planarity ⋮ 1-fan-bundle-planar drawings of graphs ⋮ A successful concept for measuring non-planarity of graphs: The crossing number. ⋮ Covering lattice points by subspaces and counting point-hyperplane incidences ⋮ An upper bound on the sum of powers of the degrees of simple 1-planar graphs ⋮ Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs ⋮ 3D Visibility Representations of 1-planar Graphs ⋮ Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count ⋮ Gap-Planar Graphs ⋮ Beyond Outerplanarity ⋮ Turning cliques into paths to achieve planarity ⋮ Nonrepetitive vertex colorings of graphs ⋮ A linear-time algorithm for testing full outer-2-planarity ⋮ On the \(k\)-planar local crossing number ⋮ Joins of 1-planar graphs ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ A linear-time algorithm for testing outer-1-planarity ⋮ Re-embedding a 1-plane graph for a straight-line drawing in linear time ⋮ On partitioning the edges of 1-plane graphs ⋮ Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar ⋮ A branch-and-cut approach to the crossing number problem ⋮ A note on the surviving rate of 1-planar graphs ⋮ Embedding-preserving rectangle visibility representations of nonplanar graphs ⋮ Upper bound on the sum of powers of the degrees of graphs with few crossings per edge ⋮ Characterizing 5-map graphs by 2-fan-crossing graphs ⋮ Crossing numbers of imbalanced graphs ⋮ On plane drawings of 2-planar graphs ⋮ Light edges in 3-connected 2-planar graphs with prescribed minimum degree ⋮ Gap-planar graphs ⋮ On the sizes of bipartite 1-planar graphs ⋮ Cubicity, degeneracy, and crossing number ⋮ Remarks on the joins of 1-planar graphs ⋮ Planar graphs having no proper 2-immersions in the plane. I ⋮ Polyline drawings with topological constraints ⋮ The maximal 1-planarity and crossing numbers of graphs ⋮ Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs ⋮ An upper bound on the number of edges in an almost planar bipartite graph ⋮ A bound on the chromatic number of an almost planar graph ⋮ Testing Full Outer-2-planarity in Linear Time ⋮ On 3D visibility representations of graphs with few crossings per edge ⋮ Beyond Planar Graphs: Introduction ⋮ Quantitative Restrictions on Crossing Patterns ⋮ Quasi-planar Graphs ⋮ 1-Planar Graphs ⋮ Algorithms for 1-Planar Graphs ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs ⋮ 1-planarity testing and embedding: an experimental study ⋮ Crossing lemma for the odd-crossing number ⋮ Topological graphs with no large grids ⋮ Which crossing number is it anyway? ⋮ Fan-planarity: properties and complexity ⋮ ON THE SUM OF POWERS OF THE DEGREES OF GRAPHS ⋮ On the Number of Edges of Fan-Crossing Free Graphs
Cites Work
This page was built for publication: Graphs drawn with few crossings per edge
