Pages that link to "Item:Q3595462"

The following pages link to On the Crossing Number of Almost Planar Graphs (Q3595462):

Displaying 31 items.

• Crossing number and weighted crossing number of near-planar graphs (Q548655) (← links)
• On crossing numbers of geometric proximity graphs (Q632725) (← links)
• Vertex insertion approximates the crossing number of apex graphs (Q661940) (← links)
• Configurations with few crossings in topological graphs (Q876504) (← links)
• A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
• Analogies between the crossing number and the tangle crossing number (Q1627199) (← links)
• The Alon-Tarsi number of planar graphs (Q1633764) (← links)
• \(k\)-planar crossing number of random graphs and random regular graphs (Q1671373) (← links)
• A tighter insertion-based approximation of the crossing number (Q2012882) (← links)
• Parameterized analysis and crossing minimization problems (Q2172859) (← links)
• Exact crossing number parameterized by vertex cover (Q2206863) (← links)
• From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
• Toroidal grid minors and stretch in embedded graphs (Q2284733) (← links)
• Crossing numbers of graph embedding pairs on closed surfaces (Q2708792) (← links)
• On the Size of Planarly Connected Crossing Graphs (Q2961524) (← links)
• An effective crossing minimisation heuristic based on star insertion (Q3121515) (← links)
• (Q3205253) (← links)
• A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (Q3448837) (← links)
• Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor (Q3595473) (← links)
• Crossing and Weighted Crossing Number of Near-Planar Graphs (Q3611835) (← links)
• Approximating the Crossing Number of Apex Graphs (Q3611879) (← links)
• The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
• (Q4552009) (← links)
• Crossing Numbers of Beyond-Planar Graphs Revisited (Q5084712) (← links)
• A Linear-Time Algorithm for Finding Induced Planar Subgraphs (Q5140735) (← links)
• Approximating the Crossing Number of Toroidal Graphs (Q5387753) (← links)
• Advances in the Planarization Method: Effective Multiple Edge Insertions (Q5895513) (← links)
• Crossing minimization in perturbed drawings (Q5896138) (← links)
• Crossing numbers of beyond-planar graphs (Q5918988) (← links)
• Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)
• Characterizing planar tanglegram layouts and applications to edge insertion problems (Q6162140) (← links)