Pages that link to "Item:Q4727445"
From MaRDI portal
The following pages link to Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design (Q4727445):
Displayed 45 items.
- The 2-page crossing number of \(K_{n}\) (Q2391708) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- Succinct representation of labeled graphs (Q2428673) (← links)
- Book drawings of complete bipartite graphs (Q2440102) (← 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)
- On the pagenumber of trivalent Cayley graphs (Q2495909) (← links)
- \(k\)-spine, 1-bend planarity (Q2503294) (← links)
- Book embedding of locally planar graphs on orientable surfaces (Q2629277) (← links)
- Drawing partial 2-trees with few slopes (Q2701381) (← links)
- The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the<i>n</i>-Cube (Q2825477) (← links)
- Characterizations of Deque and Queue Graphs (Q3104763) (← links)
- On the Page Number of Upward Planar Directed Acyclic Graphs (Q3223971) (← links)
- On Posets of Page Number 2 (Q3439398) (← links)
- On Page Number of N-free Posets (Q3439444) (← links)
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES (Q3442763) (← links)
- Embedding Outerplanar Graphs in Small Books (Q3749074) (← links)
- Classification of book representations of K6 (Q4596289) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
- Upward Partitioned Book Embeddings (Q4625113) (← links)
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles (Q5061707) (← links)
- Matching book thickness of generalized Petersen graphs (Q5081216) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- (Q5111885) (← links)
- Parameterized Algorithms for Book Embedding Problems (Q5141644) (← 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)
- On dispersable book embeddings (Q5915585) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5918733) (← links)
- Ramsey numbers of ordered graphs (Q5919338) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5925712) (← links)
- The pagenumber of \(k\)-trees is \(O(k)\) (Q5931789) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← 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)
- 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)
- Linear layouts of bipartite planar graphs (Q6179431) (← links)
- Book embeddings and crossing numbers (Q6184374) (← links)
- Efficient deterministic algorithms for embedding graphs on books (Q6184660) (← links)
- Recognizing geometric intersection graphs stabbed by a line (Q6204544) (← links)