Pages that link to "Item:Q2407041"

The following pages link to An annotated bibliography on 1-planarity (Q2407041):

Displaying 50 items.

• Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
• On fan-crossing and fan-crossing free graphs (Q1653045) (← links)
• New results on edge partitions of 1-plane graphs (Q1694686) (← links)
• \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
• 1-fan-bundle-planar drawings of graphs (Q1708027) (← links)
• Turning cliques into paths to achieve planarity (Q1725735) (← links)
• Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles (Q1725748) (← links)
• Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity (Q1725786) (← links)
• On the \(k\)-planar local crossing number (Q1727762) (← links)
• Characterizing and recognizing 4-map graphs (Q1741846) (← links)
• Gap-planar graphs (Q1786592) (← links)
• Embedding-preserving rectangle visibility representations of nonplanar graphs (Q1991089) (← links)
• A structure of 1-planar graph and its applications to coloring problems (Q2000562) (← links)
• On the sizes of bipartite 1-planar graphs (Q2030739) (← links)
• Testing gap \(k\)-planarity is NP-complete (Q2032139) (← links)
• Planar graphs having no proper 2-immersions in the plane. I (Q2037555) (← links)
• 1-embeddability of complete multipartite graphs on the projective plane (Q2037596) (← links)
• The maximal 1-planarity and crossing numbers of graphs (Q2042209) (← links)
• Non-1-planarity of lexicographic products of graphs (Q2042623) (← links)
• 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
• A note on the upper bounds on the size of bipartite and tripartite 1-embeddable graphs on surfaces (Q2107752) (← links)
• Counting cliques in 1-planar graphs (Q2111191) (← links)
• 1-planar graphs without 4-cycles or 5-cycles are 5-colorable (Q2115229) (← links)
• A survey on book-embedding of planar graphs (Q2141323) (← links)
• Optimal-area visibility representations of outer-1-plane graphs (Q2151451) (← links)
• Parameterized analysis and crossing minimization problems (Q2172859) (← links)
• On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
• Partially broken orientations of Eulerian plane graphs (Q2175805) (← links)
• On fan-crossing graphs (Q2202017) (← links)
• On the curve complexity of 3-colored point-set embeddings (Q2210505) (← links)
• On \((p, 1)\)-total labelling of some 1-planar graphs (Q2227112) (← links)
• Re-embedding a 1-plane graph for a straight-line drawing in linear time (Q2235768) (← links)
• On \((p, 1)\)-total labelling of NIC-planar graphs (Q2239035) (← links)
• Characterizing 5-map graphs by 2-fan-crossing graphs (Q2274073) (← links)
• Polyline drawings with topological constraints (Q2290634) (← links)
• Equitable partition of plane graphs with independent crossings into induced forests (Q2305905) (← links)
• On 3D visibility representations of graphs with few crossings per edge (Q2317866) (← links)
• On RAC drawings of 1-planar graphs (Q2402260) (← links)
• Dynamic list coloring of 1-planar graphs (Q2659245) (← links)
• Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
• \((k,p)\)-planarity: a relaxation of hybrid planarity (Q2664946) (← links)
• On morphing 1-planar drawings (Q2672443) (← links)
• Recognizing IC-Planar and NIC-Planar Graphs (Q4566013) (← links)
• 3D Visibility Representations of 1-planar Graphs (Q4625104) (← links)
• Gap-Planar Graphs (Q4625141) (← links)
• Beyond Outerplanarity (Q4625142) (← links)
• Beyond Planar Graphs: Introduction (Q5001653) (← links)
• Quantitative Restrictions on Crossing Patterns (Q5001654) (← links)
• 1-Planar Graphs (Q5001656) (← links)
• Edge Partitions and Visibility Representations of 1-planar Graphs (Q5001658) (← links)