Polyhedral graphs via their automorphism groups
From MaRDI portal
Publication:2423027
Recommendations
Cites work
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 2121249 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 3031989 (Why is no real title available?)
- A history of graph entropy measures
- Constructing fullerene graphs from their eigenvalues and angles
- Encoding Fullerenes and Geodesic Domes
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Fullerene graphs with exponentially many perfect matchings
- Fullerenes and coordination polyhedra versus half-cube embeddings
- Fullerenes via their automorphism groups
- Kekulé structures and the face independence number of a fullerene
- On cyclic edge-connectivity of fullerenes
- On lower bounds of number of perfect matchings in fullerene graphs
- On some structural properties of fullerene graphs
- On the automorphism group of polyhedral graphs
- Remarks on characteristic coefficients of fullerene graphs
- The symetries of cubic polyhedral graphs with face size no larger than 6
- Zigzag Structures of Simple Two-Faced Polyhedra
Cited in
(10)- Symmetries of the honeycomb toroidal graphs
- The diameter and automorphism group of Gelfand-Tsetlin polytopes
- Automorphism groups of half cubes
- Automorphism groups of 3-orbit polyhedra
- Polytopes with preassigned automorphism groups
- Symmetric graphicahedra
- A generalization of Pappus graph
- Geometric automorphism groups of graphs
- On the automorphism group of polyhedral graphs
- The symetries of cubic polyhedral graphs with face size no larger than 6
This page was built for publication: Polyhedral graphs via their automorphism groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2423027)