scientific article; zbMATH DE number 1522753

MaRDI QIDQ4511030zbMATH OpenFDO

Authors Xiaofeng Guo, Milan Randić

Publication date 4 March 2001

zbMATH Keywords

bipartite graphKekulé structureperfect matchingsextet polynomials

Mathematics Subject Classification ID

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

Review text

In the theory of chemical bonds the perfect matchings of bipartite graphs (called Kekulé structures) play an important role. To describe certain properties of the molecules requires the enumeration of the perfect matchings. This paper supplies a fast algorithm for this enumeration based on parameters of the graphs with close connection of its chemical properties. For the entire collection see [Zbl 0943.00045].

Recommendations

• A highly efficient algorithm to determine bicritical graphs
• Algorithmic aspects of bipartite graphs
• An efficient algorithm to test potential bipartiteness of graphical degree sequences
• A linear time algorithm for determining almost bipartite graphs
• A linear algorithm for bipartition of biconnected graphs
• Finding biconnected components in O(n) time for a class of graphs
• scientific article; zbMATH DE number 2159164
• Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
• Algorithm for identifying (2,2)-bipartite graphs
• A matching algorithm for regular bipartite graphs

Cited in

(4)

• A highly efficient algorithm to determine bicritical graphs
• Assigning a kekulé structure to a conjugated molecule
• Computing Bond Types in Molecule Graphs
• Computing bond orders in molecule graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511030)