Pages that link to "Item:Q4879178"
From MaRDI portal
The following pages link to The book crossing number of a graph (Q4879178):
Displaying 20 items.
- Bound for the 2-page fixed linear crossing number of hypercube graph via SDP relaxation (Q670454) (← links)
- On \(k\)-planar crossing numbers (Q885282) (← links)
- Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph (Q1304472) (← links)
- Algorithms for the fixed linear crossing number problem (Q1613416) (← links)
- The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph (Q1640218) (← links)
- Crossing number, pair-crossing number, and expansion (Q1880792) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page (Q2308500) (← links)
- The 2-page crossing number of \(K_{n}\) (Q2391708) (← links)
- Book drawings of complete bipartite graphs (Q2440102) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)
- An analysis of some linear graph layout heuristics (Q2491338) (← links)
- Crossing Minimisation Heuristics for 2-page Drawings (Q3439393) (← links)
- Experimental Evaluation of Book Drawing Algorithms (Q4625114) (← links)
- (Q5115821) (← links)
- Book Embeddings of Regular Graphs (Q5254031) (← links)
- (Q5688095) (← links)
- One- and two-page crossing numbers for some types of graphs (Q5747710) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- On book crossing numbers of the complete graph (Q6552472) (← links)
