Construction of a topological drawing of the most planar subgraph of the non-planar graph
From MaRDI portal
Publication:1792535
DOI10.1134/S0005117918050028zbMath1401.05084OpenAlexW2803739547MaRDI QIDQ1792535
Publication date: 12 October 2018
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117918050028
Cites Work
- The topological drawing of a graph: construction methods
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- EVOLUTIONARILY-FRAGMENTED ALGORITHM FOR FINDING A MAXIMAL FLAT PART OF A GRAPH
- PLANARITY TESTING AND CONSTRUCTING THE TOPOLOGICAL DRAWING OF A PLANE GRAPH (DFS)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Construction of a topological drawing of the most planar subgraph of the non-planar graph