The following pages link to The book thickness of a graph (Q1136775):
Displaying 50 items.
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design (Q4727445) (← links)
- Drawing Graphs on Few Circles and Few Spheres (Q4968377) (← links)
- Schematic Representation of Large Biconnected Graphs (Q4994348) (← links)
- The Local Queue Number of Graphs with Bounded Treewidth (Q5014102) (← links)
- On Mixed Linear Layouts of Series-Parallel Graphs (Q5014112) (← links)
- Schematic Representation of Biconnected Graphs (Q5014113) (← links)
- Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$ (Q5014139) (← links)
- (Q5075803) (← links)
- Packing 1-plane Hamiltonian cycles in complete geometric graphs (Q5080782) (← links)
- Matching book thickness of generalized Petersen graphs (Q5081216) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- (Q5111885) (← links)
- Edge crossings in random linear arrangements (Q5135062) (← links)
- Parameterized Algorithms for Book Embedding Problems (Q5141644) (← links)
- PARTITIONS OF COMPLETE BIPARTITE GEOMETRIC GRAPHS INTO PLANE PERFECT MATCHINGS (Q5237541) (← links)
- Book Embedding of Graphs on the Projective Plane (Q5237910) (← links)
- Book Embeddings of Regular Graphs (Q5254031) (← links)
- Succinct Representation of Labeled Graphs (Q5387767) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- On dispersable book embeddings (Q5915585) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5918733) (← links)
- 2-colored point-set embeddings of partial 2-trees (Q5925531) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5925712) (← links)
- The pagenumber of \(k\)-trees is \(O(k)\) (Q5931789) (← links)
- A Sublinear Bound on the Page Number of Upward Planar Graphs (Q6057803) (← links)
- On asymptotic packing of convex geometric and ordered graphs (Q6062874) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- The maximum linear arrangement problem for trees under projectivity and planarity (Q6072193) (← links)
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs (Q6080147) (← links)
- Stack and queue number of 2-trees (Q6085708) (← links)
- Book thickness of the non-zero component union graph of the finite dimensional vector space (Q6099758) (← links)
- A survey on the Intersection graphs of ideals of rings (Q6101486) (← links)
- Untangling circular drawings: algorithms and complexity (Q6101838) (← links)
- On the dispersability of odd toroidal grids (Q6106027) (← links)
- The matching book embeddings of pseudo-Halin graphs (Q6109796) (← links)
- Finding geometric representations of apex graphs is \textsf{NP}-hard (Q6175518) (← links)
- Book embeddings and crossing numbers (Q6184374) (← links)
- A positive fraction Erdős-Szekeres theorem and its applications (Q6186490) (← links)
- Recognizing geometric intersection graphs stabbed by a line (Q6204544) (← links)
- (Q6204659) (← links)
- Using Euler’s Formula to Find the Lower Bound of the Page Number (Q6489355) (← links)
- On 1-bend upward point-set embeddings of \(st\)-digraphs (Q6547912) (← links)
- Three edge-disjoint plane spanning paths in a point set (Q6560157) (← links)
- The dispersability of the Kronecker cover of the product of complete graphs and cycles (Q6571570) (← links)
- Quantum graph drawing (best student paper) (Q6575378) (← links)
- Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover (Q6610085) (← links)
- On dispersability of some circulant graphs (Q6616230) (← links)
- Universal geometric graphs (Q6632774) (← links)
- Splitting plane graphs to outerplanarity (Q6636997) (← links)
- Approximate realizations for outerplanaric degree sequences (Q6655667) (← links)
