Pages that link to "Item:Q1272189"

The following pages link to Graphs drawn with few crossings per edge (Q1272189):

Displaying 50 items.

• 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
• Crossing lemma for the odd-crossing number (Q2088881) (← links)
• The density of fan-planar graphs (Q2121760) (← links)
• A survey on book-embedding of planar graphs (Q2141323) (← links)
• Edge-minimum saturated \(k\)-planar drawings (Q2151425) (← links)
• Simplifying non-simple fan-planar drawings (Q2151431) (← links)
• Recognizing and embedding simple optimal 2-planar graphs (Q2151433) (← links)
• The crossing number of twisted graphs (Q2163801) (← links)
• On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
• On topological graphs with at most four crossings per edge (Q2175439) (← links)
• Efficient generation of different topological representations of graphs beyond-planarity (Q2206855) (← links)
• Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
• Re-embedding a 1-plane graph for a straight-line drawing in linear time (Q2235768) (← links)
• Characterizing 5-map graphs by 2-fan-crossing graphs (Q2274073) (← links)
• Remarks on the joins of 1-planar graphs (Q2286052) (← links)
• Polyline drawings with topological constraints (Q2290634) (← links)
• On 3D visibility representations of graphs with few crossings per edge (Q2317866) (← links)
• Fan-planarity: properties and complexity (Q2346379) (← links)
• Iterated point-line configurations grow doubly-exponentially (Q2380786) (← links)
• Area requirement of graph drawings with few crossings per edge (Q2391538) (← links)
• On RAC drawings of 1-planar graphs (Q2402260) (← links)
• An annotated bibliography on 1-planarity (Q2407041) (← links)
• On the recognition of fan-planar and maximal outer-fan-planar graphs (Q2408919) (← links)
• The book thickness of 1-planar graphs is constant (Q2408921) (← links)
• An upper bound on the sum of powers of the degrees of simple 1-planar graphs (Q2448897) (← links)
• Cubicity, degeneracy, and crossing number (Q2509731) (← links)
• Topological graphs with no large grids (Q2573803) (← links)
• Facial list colourings of plane graphs (Q2629297) (← links)
• Dynamic list coloring of 1-planar graphs (Q2659245) (← links)
• \((k,p)\)-planarity: a relaxation of hybrid planarity (Q2664946) (← links)
• Crossings between non-homotopic edges (Q2673492) (← links)
• A note on odd colorings of 1-planar graphs (Q2689651) (← links)
• Testing Full Outer-2-planarity in Linear Time (Q2827826) (← links)
• On the sum of powers of the degrees of graphs (Q2872000) (← links)
• On the Number of Edges of Fan-Crossing Free Graphs (Q2872081) (← links)
• Space crossing numbers (Q2888867) (← links)
• On the Size of Planarly Connected Crossing Graphs (Q2961524) (← links)
• Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time (Q2961525) (← links)
• On the Density of Non-simple 3-Planar Graphs (Q2961527) (← links)
• Stack and Queue Layouts via Layered Separators (Q2961542) (← links)
• A PTAS for the Cluster Editing Problem on Planar Graphs (Q2971154) (← links)
• Crossing numbers of imbalanced graphs (Q3055901) (← links)
• Right Angle Crossing Graphs and 1-Planarity (Q3223950) (← links)
• (Q4273877) (← links)
• 3D Visibility Representations of 1-planar Graphs (Q4625104) (← links)
• Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (Q4625139) (← links)
• Gap-Planar Graphs (Q4625141) (← links)
• Beyond Outerplanarity (Q4625142) (← links)
• Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
• Beyond Planar Graphs: Introduction (Q5001653) (← links)