Intersection Graphs in Simultaneous Embedding with Fixed Edges
From MaRDI portal
Recommendations
- Embedding Graphs Simultaneously with Fixed Edges
- Simultaneous Graph Embeddings with Fixed Edges
- Simultaneous intersection representation of pairs of graphs
- On the structure of certain intersection graphs
- Simultaneous embedding of embedded planar graphs
- Simultaneous embedding of embedded planar graphs
- scientific article; zbMATH DE number 125465
- scientific article; zbMATH DE number 975396
- scientific article; zbMATH DE number 870959
- Characterizing simultaneous embedding with fixed edges
Cited in
(14)- Bundled Crossings in Embedded Graphs
- Simultaneous orthogonal planarity
- Simultaneous embedding of embedded planar graphs
- Disconnectivity and relative positions in simultaneous embeddings
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
- Parameterized complexity of simultaneous planarity
- Synchronized Planarity with Applications to Constrained Planarity Problems
- Clustered planarity with pipes
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
- Simultaneous Embedding
- Characterizing simultaneous embedding with fixed edges
- Drawing Simultaneously Embedded Graphs with Few Bends
- Advancements on SEFE and partitioned book embedding problems
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
This page was built for publication: Intersection Graphs in Simultaneous Embedding with Fixed Edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184611)
