Pruning the search tree in the constructive enumeration of molecular graphs

DOI10.1016/0166-218X(95)00019-NzbMath0948.05049MaRDI QIDQ1917340

Vladimir Kvasnička, Jiři Pospíchal

Publication date: 19 November 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

labelingautomorphism groupadjacency matrixsearch treeenumeration of molecular graphs

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Conditions for sequences to be r-graphic
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• An optimal lower bound on the number of variables for graph identification
• Constructive graph labeling using double cosets
• A remark on the existence of finite graphs
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Orderly algorithms for generating restricted classes of graphs
• Backtrack Programming
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pruning the search tree in the constructive enumeration of molecular graphs