Pages that link to "Item:Q3611835"

The following pages link to Crossing and Weighted Crossing Number of Near-Planar Graphs (Q3611835):

Displaying 18 items.

• Crossing number and weighted crossing number of near-planar graphs (Q548655) (← links)
• Strong embeddings of minimum genus (Q709302) (← links)
• On the edge crossing properties of Euclidean minimum weight Laman graphs (Q902420) (← links)
• Crossing minimization in weighted bipartite graphs (Q1044030) (← 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)
• Crossing and thickness of special type of non-planar graph (Q2844109) (← links)
• On the Size of Planarly Connected Crossing Graphs (Q2961524) (← links)
• On the Crossing Number of Almost Planar Graphs (Q3595462) (← links)
• Approximating the Crossing Number of Apex Graphs (Q3611879) (← links)
• The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
• Crossing Numbers of Beyond-Planar Graphs Revisited (Q5084712) (← links)
• (Q5136229) (← links)
• A Linear-Time Algorithm for Finding Induced Planar Subgraphs (Q5140735) (← links)
• Crossing Minimization in Weighted Bipartite Graphs (Q5432313) (← links)
• Advances in the Planarization Method: Effective Multiple Edge Insertions (Q5895513) (← links)
• Crossing numbers of beyond-planar graphs (Q5918988) (← links)