Pages that link to "Item:Q5666571"
From MaRDI portal
The following pages link to A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs (Q5666571):
Displaying 14 items.
- Edge reductions in cyclically \(k\)-connected cubic graphs (Q922553) (← links)
- Generating the \(c^*5\)-connected graphs (Q1246541) (← links)
- Generating \(r\)-regular graphs (Q1406030) (← links)
- Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face (Q1657010) (← links)
- Generating closed 2-cell embeddings in the torus and the projective plane (Q1819729) (← links)
- Theory of families of polytopes: fullerenes and Pogorelov polytopes (Q1980457) (← links)
- The spanning maximal planar subgraph problem for some classes of complete 4-partite graphs (Q2079986) (← links)
- Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions (Q2285396) (← links)
- Geometric biplane graphs. II: Graph augmentation (Q2345512) (← links)
- Cyclically five-connected cubic graphs (Q2396896) (← links)
- Construction of planar triangulations with minimum degree 5 (Q2581624) (← links)
- Recursive Generation of 5-Regular Planar Graphs (Q3605492) (← links)
- Generating 5-regular planar graphs (Q3652532) (← links)
- Construction of acyclically 4-colourable planar triangulations with minimum degree 4 (Q5031739) (← links)