Optimized algorithm to find all symmetry-distinct maps of a graph: Application to topology-driven molecular design

DOI10.1007/s10910-008-9413-4zbMath1187.92085OpenAlexW2030928707MaRDI QIDQ1029757

Erwin Lijnen, Arnout Ceulemans

Publication date: 13 July 2009

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-008-9413-4

zbMATH Keywords

topologycarbonallotropesgraph-embeddingsmolecular design

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Optimized algorithm to find all symmetry-distinct maps of a graph: Application to topology-driven molecular design

Cites Work

• Optimized algorithm to find all symmetry-distinct maps of a graph: Application to topology-driven molecular design
• Enumerating 2-Cell Imbeddings of Connected Graphs
• Abstract Regular Polytopes
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimized algorithm to find all symmetry-distinct maps of a graph: Application to topology-driven molecular design