Pages that link to "Item:Q4027844"
From MaRDI portal
The following pages link to Combinatorial Local Planarity and the Width of Graph Embeddings (Q4027844):
Displayed 24 items.
- Spanners in sparse graphs (Q657919) (← links)
- Strong embeddings of minimum genus (Q709302) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- A simpler proof of the excluded minor theorem for higher surfaces (Q1362099) (← links)
- Blocking nonorientability of a surface (Q1403908) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- On essential and inessential polygons in embedded graphs (Q1850578) (← links)
- Uniqueness and minimality of large face-width embeddings of graphs (Q1906851) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces (Q2048350) (← links)
- Non-zero sum Heffter arrays and their applications (Q2144503) (← links)
- Contraction obstructions for treewidth (Q2275894) (← links)
- Mutation on knots and Whitney's 2-isomorphism theorem (Q2376653) (← links)
- Asymptotic enumeration and limit laws for graphs of fixed genus (Q2431243) (← links)
- On the flexibility of toroidal embeddings (Q2464151) (← links)
- The chromatic polynomial of fatgraphs and its categorification (Q2470415) (← links)
- (Q2702745) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs (Q4933601) (← links)
- Relative Heffter arrays and biembeddings (Q4988851) (← links)
- (Q6072054) (← links)
- Weak Heffter arrays and biembedding graphs on non-orientable surfaces (Q6117411) (← links)
- (Q6119462) (← links)
- Tight globally simple nonzero sum Heffter arrays and biembeddings (Q6187000) (← links)