Pages that link to "Item:Q1272189"
From MaRDI portal
The following pages link to Graphs drawn with few crossings per edge (Q1272189):
Displaying 50 items.
- The Szemerédi-Trotter theorem in the complex plane (Q276440) (← links)
- Outer 1-planar graphs (Q289919) (← links)
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- On graphs, which can be drawn on an orientable surface with small number of intersections on an edge (Q291177) (← links)
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (Q391976) (← links)
- Proper 1-immersions of graphs triangulating the plane (Q394202) (← links)
- On drawings and decompositions of 1-planar graphs (Q396768) (← links)
- A note on 1-planar graphs (Q401145) (← links)
- 1-planarity of complete multipartite graphs (Q412349) (← links)
- Joins of 1-planar graphs (Q477875) (← links)
- A linear-time algorithm for testing outer-1-planarity (Q494794) (← links)
- On partitioning the edges of 1-plane graphs (Q501676) (← links)
- A note on the surviving rate of 1-planar graphs (Q512598) (← links)
- On crossing numbers of geometric proximity graphs (Q632725) (← links)
- Nonrepetitive vertex colorings of graphs (Q658062) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Light edges in 3-connected 2-planar graphs with prescribed minimum degree (Q723598) (← links)
- An upper bound on the number of edges in an almost planar bipartite graph (Q744552) (← links)
- A bound on the chromatic number of an almost planar graph (Q744556) (← links)
- On the maximum number of edges in quasi-planar graphs (Q878960) (← links)
- On the edge crossing properties of Euclidean minimum weight Laman graphs (Q902420) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- On an extremal problem in the class of bipartite 1-planar graphs (Q907838) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Crossing-number critical graphs have bounded path-width (Q1400969) (← links)
- A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
- Note on \(k\)-planar crossing numbers (Q1699274) (← links)
- Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
- Drawing graphs using a small number of obstacles (Q1702349) (← links)
- 1-fan-bundle-planar drawings of graphs (Q1708027) (← links)
- Covering lattice points by subspaces and counting point-hyperplane incidences (Q1716001) (← links)
- Turning cliques into paths to achieve planarity (Q1725735) (← links)
- A linear-time algorithm for testing full outer-2-planarity (Q1727743) (← links)
- On the \(k\)-planar local crossing number (Q1727762) (← links)
- Gap-planar graphs (Q1786592) (← links)
- Which crossing number is it anyway? (Q1850498) (← links)
- Geometric graphs with no self-intersecting path of length three (Q1883291) (← links)
- The structure of plane graphs with independent crossings and its applications to coloring problems (Q1935605) (← links)
- Right angle crossing graphs and 1-planarity (Q1949102) (← links)
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar (Q1985441) (← links)
- Embedding-preserving rectangle visibility representations of nonplanar graphs (Q1991089) (← links)
- Upper bound on the sum of powers of the degrees of graphs with few crossings per edge (Q2009245) (← links)
- On plane drawings of 2-planar graphs (Q2027310) (← links)
- On the sizes of bipartite 1-planar graphs (Q2030739) (← links)
- Planar graphs having no proper 2-immersions in the plane. I (Q2037555) (← links)
- The maximal 1-planarity and crossing numbers of graphs (Q2042209) (← links)
- 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)
