Embedding Graphs into Embedded Graphs

DOI10.4230/LIPICS.ISAAC.2017.34zbMATH Open1457.68214OpenAlexW2963862502MaRDI QIDQ5136253FDOQ5136253

Authors Radoslav Fulek 

Publication date 25 November 2020

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2017/8223/pdf/LIPIcs-ISAAC-2017-34.pdf/

zbMATH Keywords

graph embeddingweakly simple polygonsc-planarity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Embedding graphs into embedded graphs
• scientific article; zbMATH DE number 51713
• Embeddings of graphs
• scientific article; zbMATH DE number 4164896
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Publication:4716822
• Embedding into Bipartite Graphs
• Embeddings of one kind of graphs
• Digraph embedding
• Publication:4722086

Cites work

• scientific article; zbMATH DE number 5776838 (Why is no real title available?)
• scientific article; zbMATH DE number 1974122 (Why is no real title available?)
• scientific article; zbMATH DE number 1498604 (Why is no real title available?)
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• A new perspective on clustered planarity as a combinatorial embedding problem
• Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
• C-Planarity of C-Connected Clustered Graphs
• Clustered Planarity with Pipes
• Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
• Clustered planarity testing revisited
• Clustered planarity: small clusters in cycles and Eulerian graphs
• Detecting weakly simple polygons
• Graph Drawing
• On approximability by embeddings of cycles in the plane.
• On embedding a cycle in a plane graph
• On separating two simple polygons by a single translation
• Planarity for clustered graphs
• Realization of mappings
• Recognizing weakly simple polygons
• Strip planarity testing for embedded planar graphs
• Unified Hanani-Tutte theorem

Cited in

(17)

• Graph ear decompositions and graph embeddings
• Stratified graphs for imbedding systems
• Embedding into Bipartite Graphs
• Proceedings of the conference ``Embedded graphs
• Clustered planarity = flat clustered planarity
• Stability of intersections of graphs in the plane and the van Kampen obstruction
• Embeddings of graphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Beyond Clustered Planar Graphs
• scientific article; zbMATH DE number 4164896 (Why is no real title available?)
• Embedding graphs into embedded graphs
• scientific article; zbMATH DE number 4126319 (Why is no real title available?)
• scientific article; zbMATH DE number 867699 (Why is no real title available?)
• Homogeneously embedding stratified graphs in stratified graphs
• scientific article; zbMATH DE number 4139769 (Why is no real title available?)
• Graph Ear Decompositions and Graph Embeddings
• Hanani-Tutte for approximating maps of graphs

This page was built for publication: Embedding Graphs into Embedded Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136253)