The following pages link to The book thickness of a graph. II (Q3977581):
Displaying 17 items.
- Graphs with small book thickness (Q1001691) (← links)
- Algorithms for the fixed linear crossing number problem (Q1613416) (← links)
- On dispersability of some products of cycles (Q2116698) (← links)
- On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page (Q2308500) (← links)
- On the rectilinear crossing number of complete uniform hypergraphs (Q2362105) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- The book thickness of 1-planar graphs is constant (Q2408921) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)
- Extension of a theorem of Whitney (Q2470340) (← links)
- An analysis of some linear graph layout heuristics (Q2491338) (← links)
- The Crossing Number of the Cone of a Graph (Q2961536) (← links)
- Crossing Minimisation Heuristics for 2-page Drawings (Q3439393) (← links)
- The Crossing Number of the Cone of a Graph (Q4579956) (← links)
- (Q5111885) (← links)
- Book embeddings and crossing numbers (Q6184374) (← links)
- On book crossing numbers of the complete graph (Q6552472) (← links)
- On dispersability of some circulant graphs (Q6616230) (← links)
