Pages that link to "Item:Q450560"

The following pages link to Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph (Q450560):

Displaying 25 items.

• Topological morphing of planar graphs (Q386891) (← links)
• Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
• Clustered planarity = flat clustered planarity (Q1725728) (← links)
• Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996) (← links)
• Simultaneous embedding: edge orderings, relative positions, cutvertices (Q1751092) (← links)
• Stack-number is not bounded by queue-number (Q2151179) (← links)
• Relaxing the constraints of clustered planarity (Q2261574) (← links)
• Planarity of streamed graphs (Q2333805) (← links)
• Advancements on SEFE and partitioned book embedding problems (Q2339452) (← links)
• Disconnectivity and relative positions in simultaneous embeddings (Q2349740) (← links)
• An annotated bibliography on 1-planarity (Q2407041) (← links)
• The importance of being proper (Q2512653) (← links)
• Simultaneous Orthogonal Planarity (Q2961544) (← links)
• Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree (Q3000509) (← links)
• SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS (Q3459356) (← links)
• Simultaneous Embedding (Q5001665) (← links)
• Atomic Embeddability, Clustered Planarity, and Thickenability (Q5066950) (← links)
• Upward Book Embeddings of st-Graphs (Q5088940) (← links)
• Simultaneous Embeddings with Few Bends and Crossings (Q5233141) (← links)
• Hierarchical partial planarity (Q5915789) (← links)
• (Q6065397) (← links)
• Drawing Simultaneously Embedded Graphs with Few Bends (Q6066464) (← links)
• Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
• On 3-coloring circle graphs (Q6560146) (← links)
• On 3-coloring circle graphs (Q6636987) (← links)