Pages that link to "Item:Q3611864"
From MaRDI portal
The following pages link to Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing (Q3611864):
Displayed 50 items.
- A family of efficient six-regular circulants representable as a Kronecker product (Q260026) (← links)
- Outer 1-planar graphs (Q289919) (← links)
- Recognizing and drawing IC-planar graphs (Q290513) (← 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)
- Drawing complete multipartite graphs on the plane with restrictions on crossings (Q477904) (← links)
- A linear-time algorithm for testing outer-1-planarity (Q494794) (← links)
- On partitioning the edges of 1-plane graphs (Q501676) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← 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)
- Linear-time recognition of map graphs with outerplanar witness (Q1662161) (← links)
- Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- A linear-time algorithm for testing full outer-2-planarity (Q1727743) (← links)
- The matching extendability of optimal 1-planar graphs (Q1756050) (← links)
- Light subgraphs in the family of 1-planar graphs with high minimum degree (Q1757981) (← links)
- Gap-planar graphs (Q1786592) (← links)
- Right angle crossing graphs and 1-planarity (Q1949102) (← 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)
- Non-1-planarity of lexicographic products of graphs (Q2042623) (← links)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Minimal graphs with respect to geometric distance realizability (Q2214306) (← 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)
- On 3D visibility representations of graphs with few crossings per edge (Q2317866) (← links)
- Geometric biplane graphs. I: Maximal graphs (Q2345511) (← links)
- Fan-planarity: properties and complexity (Q2346379) (← links)
- \(K_7\)-minors in optimal 1-planar graphs (Q2400554) (← 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)
- \(\mathsf{NIC}\)-planar graphs (Q2410219) (← links)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
- A fast algorithm for the product structure of planar graphs (Q2663717) (← links)
- Testing Full Outer-2-planarity in Linear Time (Q2827826) (← links)
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time (Q2961525) (← links)
- Right Angle Crossing Graphs and 1-Planarity (Q3223950) (← links)