Pages that link to "Item:Q2496198"
From MaRDI portal
The following pages link to Crossing number is hard for cubic graphs (Q2496198):
Displaying 23 items.
- Outer 1-planar graphs (Q289919) (← links)
- Orthogonal drawings and crossing numbers of the Kronecker product of two cycles (Q433407) (← links)
- Planar crossing numbers of graphs of bounded genus (Q452001) (← links)
- On the red/blue spanning tree problem (Q534557) (← links)
- Crossing numbers of graphs with rotation systems (Q548653) (← links)
- The crossing number of \(K_{1,m,n}\) (Q998333) (← links)
- Hardness of approximation for crossing number (Q1943651) (← links)
- Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\) (Q2125226) (← links)
- Star-struck by fixed embeddings: modern crossing number heuristics (Q2151428) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Toroidal grid minors and stretch in embedded graphs (Q2284733) (← links)
- Two recursive inequalities for crossing numbers of graphs (Q2358375) (← links)
- Inapproximability ratios for crossing number (Q2413159) (← links)
- There are no cubic graphs on 26 vertices with crossing number 10 or 11 (Q2657046) (← links)
- Approximating the Maximum Rectilinear Crossing Number (Q2817887) (← links)
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing (Q3611864) (← links)
- Deciding Parity of Graph Crossing Number (Q4578013) (← links)
- Connecting the dots (with minimum crossings) (Q5088932) (← links)
- Approximating the Crossing Number of Toroidal Graphs (Q5387753) (← links)
- Algorithms for the Hypergraph and the Minor Crossing Number Problems (Q5387756) (← links)
- Crossing Number of Graphs with Rotation Systems (Q5452204) (← links)
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics (Q5886037) (← links)
- Bounding the tripartite‐circle crossing number of complete tripartite graphs (Q6057580) (← links)
