Pages that link to "Item:Q661940"

The following pages link to Vertex insertion approximates the crossing number of apex graphs (Q661940):

Displaying 15 items.

• \(\mathcal{P}\)-apex graphs (Q1708380) (← links)
• Crossing numbers and stress of random graphs (Q1725756) (← links)
• Face covers and the genus problem for apex graphs (Q1850536) (← links)
• Crossing number for graphs with bounded pathwidth (Q1986966) (← links)
• A tighter insertion-based approximation of the crossing number (Q2012882) (← links)
• Exact crossing number parameterized by vertex cover (Q2206863) (← links)
• Toroidal grid minors and stretch in embedded graphs (Q2284733) (← links)
• An effective crossing minimisation heuristic based on star insertion (Q3121515) (← links)
• Approximating the Crossing Number of Apex Graphs (Q3611879) (← links)
• The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
• Kernelization of Whitney Switches (Q4997132) (← links)
• (Q5136229) (← links)
• Kernelization of Whitney Switches (Q5874518) (← links)
• Advances in the Planarization Method: Effective Multiple Edge Insertions (Q5895513) (← links)
• Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)