Pages that link to "Item:Q5060116"
From MaRDI portal
The following pages link to On the complexity of graph embeddings (Q5060116):
Displaying 15 items.
- A note on approximating graph genus (Q290221) (← links)
- Complexity issues in color-preserving graph embeddings (Q846361) (← links)
- Algorithmic graph embeddings (Q1391310) (← links)
- Proceedings of the conference ``Embedded graphs'' (Q1687942) (← links)
- A tight lower bound on the maximum genus of a simplicial graph (Q1923508) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- (Q3313787) (← links)
- (Q4206115) (← links)
- (Q4273838) (← links)
- High-Speed and Noise-Robust Embedding of Hypergraphs Based on Double-Centered Incidence Matrix (Q5050372) (← links)
- Embedding graphs into two-dimensional simplicial complexes (Q5115795) (← links)
- On Whole-Graph Embedding Techniques (Q5153023) (← links)
- Embedding graphs into two-dimensional simplicial complexes (Q5881549) (← links)
- Graph Drawing (Q5896899) (← links)
- Algorithmic graph embeddings (Q6085703) (← links)