Pages that link to "Item:Q3882482"
From MaRDI portal
The following pages link to Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings (Q3882482):
Displaying 15 items.
- Discrete Jordan curve theorems (Q580354) (← links)
- Region distributions of some small diameter graphs (Q807641) (← links)
- On the Euler genus of a 2-connected graph (Q1074592) (← links)
- On the non-orientable genus of a 2-connected graph (Q1074593) (← links)
- Computing the genus of the 2-amalgamations of graphs (Q1076031) (← links)
- An additivity theorem for the genus of a graph (Q1088997) (← links)
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs (Q1119660) (← links)
- Combinatorial maps (Q1167192) (← links)
- On the number of maximum genus embeddings of almost all graphs (Q1193548) (← links)
- Genus distributions for bouquets of circles (Q1263599) (← links)
- A Nebeský-type characterization for relative maximum genus (Q1272649) (← links)
- On the genus distributions of wheels and of related graphs (Q1699533) (← links)
- A combinatorial analog of the Jordan Curve Theorem (Q1835918) (← links)
- Bounds for the average genus of the vertex-amalgamation of graphs (Q1896359) (← links)
- (Q5088969) (← links)
