Pages that link to "Item:Q3897065"
From MaRDI portal
The following pages link to Embedding Graphs in the Plane—Algorithmic Aspects (Q3897065):
Displaying 18 items.
- A characterization of planar graphs by Trémaux orders (Q1065816) (← links)
- Projective plan and Möbius band obstructions (Q1385984) (← links)
- A large set of torus obstructions and how they were discovered (Q1700776) (← links)
- The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs (Q1893154) (← links)
- Gap strings and spanning forests for bridge graphs of biconnected graphs (Q1923606) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- (Q2702747) (← links)
- Discrete characterizations of planarity part I: the classical viewpoint (Q3342595) (← links)
- Segment graphs, depth-first cycle bases, 3-connectivity, and planarity of graphs (Q3659804) (← links)
- Determining outerplanarity using segment graphs (Q3659805) (← links)
- Finding triconnected components of graphs (Q3659812) (← links)
- Ranking and unranking planar embeddings (Q3728923) (← links)
- Menus of kuratowski subgraphs (Q3801576) (← links)
- Obstructions for the Disk and the Cylinder Embedding Extension Problems (Q4314155) (← links)
- A matrix analysis of carrier posets of biconnected graphs (Q4322525) (← links)
- Bijective comparison of optimal planarity algorithms (Q4838131) (← links)
- Embedding graphs in the torus in linear time (Q5101428) (← links)
- (Q5463581) (← links)
