Computing the maximal canonical form for trees in polynomial time

DOI10.1007/s10910-018-0867-8zbMath1388.05035OpenAlexW2790858956MaRDI QIDQ2636446

Gunnar Brinkmann

Publication date: 5 June 2018

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

Full work available at URL: https://biblio.ugent.be/publication/8558358

zbMATH Keywords

canonical formstructure enumeration

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Uses Software

• GENREG

Cites Work

• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Fast generation of regular graphs and construction of cages
• Fast generation of cubic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the maximal canonical form for trees in polynomial time