The following pages link to \(\mathsf{NIC}\)-planar graphs (Q2410219):
Displayed 23 items.
- On fan-crossing and fan-crossing free graphs (Q1653045) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- A heuristic approach towards drawings of graphs with high crossing resolution (Q1725757) (← links)
- Characterizing and recognizing 4-map graphs (Q1741846) (← links)
- The maximal 1-planarity and crossing numbers of graphs (Q2042209) (← links)
- On \((p, 1)\)-total labelling of NIC-planar graphs (Q2239035) (← links)
- Characterizing 5-map graphs by 2-fan-crossing graphs (Q2274073) (← links)
- Remarks on the joins of 1-planar graphs (Q2286052) (← links)
- Linear arboricity of NIC-planar graphs (Q2300535) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- Map graphs having witnesses of large girth (Q2632022) (← links)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
- Recognizing IC-Planar and NIC-Planar Graphs (Q4566013) (← links)
- Quantitative Restrictions on Crossing Patterns (Q5001654) (← links)
- Edge Partitions and Visibility Representations of 1-planar Graphs (Q5001658) (← links)
- Right Angle Crossing Drawings of Graphs (Q5001661) (← links)
- IC-Planar Graphs Are 6-Choosable (Q5009330) (← links)
- (Q5874523) (← links)
- On RAC drawings of graphs with one bend per edge (Q5915940) (← links)
- Compact drawings of 1-planar graphs with right-angle crossings and few bends (Q5915941) (← links)
- On RAC drawings of graphs with one bend per edge (Q5918835) (← links)
- (Q6179340) (← links)
- (Q6188647) (← links)