The following pages link to (Q3880860):
Displayed 16 items.
- On the genus and thickness of graphs (Q581411) (← links)
- The crossing numbers of products of 5-vertex graphs with cycles (Q878632) (← links)
- The matching extendability of surfaces (Q918993) (← links)
- Embeddings of infinite graphs (Q1074594) (← links)
- Grids and their minors (Q1097897) (← links)
- On a pursuit game played on graphs for which a minor is excluded (Q1101027) (← links)
- The maximum genus of graph bundles (Q1101120) (← links)
- An efficient parallel algorithm for planarity (Q1114415) (← links)
- On the thickness and arboricity of a graph (Q1121907) (← links)
- Drawings of \(C_m\times C_n\) with one disjoint family (Q1306302) (← links)
- Coverings of complete bipartite graphs and associated structures (Q1339873) (← links)
- A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
- Edge-colorability of graph bundles (Q1835926) (← links)
- The bipartite-cylindrical crossing number of the complete bipartite graph (Q2308490) (← links)
- (Q3784090) (← links)
- On the complexity of graph reconstruction (Q4298372) (← links)