On embedding a cycle in a plane graph
From MaRDI portal
Publication:1011765
DOI10.1016/j.disc.2007.12.090zbMath1172.05016OpenAlexW4213252030MaRDI QIDQ1011765
Giuseppe Di Battista, Maurizio Patrignani, Pier Francesco Cortese, Maurizio Pizzonia
Publication date: 9 April 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.090
algorithmcycleembeddingtime complexitygraph drawingclustered planarityplanarity testingclustered graph
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Reconstruction of Weakly Simple Polygons from Their Edges, Atomic Embeddability, Clustered Planarity, and Thickenability, Clustered planarity with pipes, Recognizing weakly simple polygons, A new perspective on clustered planarity as a combinatorial embedding problem, \(c\)-planarity of embedded cyclic \(c\)-graphs, Straight-line rectangular drawings of clustered graphs, Embedding graphs into embedded graphs, Clustered planarity = flat clustered planarity, Crossing minimization in perturbed drawings, Stability of intersections of graphs in the plane and the van Kampen obstruction, Strip planarity testing for embedded planar graphs, Crossing minimization in perturbed drawings, Relaxing the constraints of clustered planarity, Hanani-Tutte for approximating maps of graphs, C-planarity testing of embedded clustered graphs with bounded dual carving-width, Bounded Embeddings of Graphs in the Plane, Beyond Clustered Planar Graphs, A Census of Plane Graphs with Polyline Edges, Embedding Graphs into Embedded Graphs
Cites Work
