Pages that link to "Item:Q3611864"

The following pages link to Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing (Q3611864):

Displayed 20 items.

• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing (Q3611864) ‎ (← links)
• Recognizing IC-Planar and NIC-Planar Graphs (Q4566013) ‎ (← links)
• 3D Visibility Representations of 1-planar Graphs (Q4625104) ‎ (← links)
• Gap-Planar Graphs (Q4625141) ‎ (← links)
• (Q4908823) (redirect page) ‎ (← links)
• Beyond Planar Graphs: Introduction (Q5001653) ‎ (← links)
• Quantitative Restrictions on Crossing Patterns (Q5001654) ‎ (← links)
• 1-Planar Graphs (Q5001656) ‎ (← links)
• Algorithms for 1-Planar Graphs (Q5001657) ‎ (← links)
• Edge Partitions and Visibility Representations of 1-planar Graphs (Q5001658) ‎ (← links)
• $$\textit{\textbf{k}}$$-Planar Graphs (Q5001659) ‎ (← links)
• A Tipping Point for the Planarity of Small and Medium Sized Graphs (Q5014116) ‎ (← links)
• 2-Layer k-Planar Graphs (Q5014133) ‎ (← links)
• (Q5089197) ‎ (← links)
• Complexity of Geometric k-Planarity for Fixed k (Q5144878) ‎ (← links)
• Crossing numbers of beyond-planar graphs (Q5918404) ‎ (← links)
• Crossing numbers of beyond-planar graphs (Q5918988) ‎ (← links)
• All 2-planar graphs having the same spanning subgraph (Q6087085) ‎ (← links)
• Maximal 1-plane graphs with dominating vertices (Q6096305) ‎ (← links)
• Weak-dynamic coloring of graphs beyond-planarity (Q6144496) ‎ (← links)