The following pages link to (Q5335885):
Displaying 15 items.
- Errors in graph embedding algorithms (Q632808) (← links)
- A generalization of outerplanar graphs (Q799687) (← links)
- An algorithm for imbedding cubic graphs in the torus (Q1140090) (← links)
- Improved planarity algorithms (Q1161292) (← links)
- A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits (Q1326755) (← links)
- Reconstruction graphs and testing their properties in a relational spatial database (Q1609074) (← links)
- A large set of torus obstructions and how they were discovered (Q1700776) (← links)
- Facilities layout generalized model solved by n-boundary shortest path heuristics (Q1820668) (← links)
- The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs (Q1893154) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- Automatische Abbildung eines planaren Graphen in einen ebenen Streckengraphen (Q2560417) (← links)
- Characterizing 2-crossing-critical graphs (Q2635081) (← links)
- El mapa de cuatro colores ¿Conjetura o Teorema? (Q3872490) (← links)
- A practical algorithm for the computation of the genus (Q5037919) (← links)
- (Q5463581) (← links)
