scientific article; zbMATH DE number 4083653
From MaRDI portal
Publication:3813828
Cited in
(19)- Subgraph generating functions in chemistry---an example for perfect matchings on honeycomb fragments
- Hamilton paths in \(Z\)-transformation graphs of perfect matchings of hexagonal systems
- Wiener number of vertex-weighted graphs and a chemical application
- Perfect matchings and ears in elementary bipartite graphs
- Number of maximum matchings of bipartite graphs with positive surplus
- Forcing and anti-forcing edges in bipartite graphs
- Energy ordering of catacondensed hexagonal systems
- Regular coronoids and 4-tilings
- Single coronoid systems with an anti-forcing edge
- Extremal double hexagonal chains with respect to k-matchings and k-independent sets
- On plane bipartite graphs without fixed edges
- Decomposition theorem on matchable distributive lattices
- Global forcing number of benzenoid graphs
- A fully benzenoid system has a unique maximum cardinality resonant set
- Enumeration of subtrees of trees
- Topological aspects of benzenoids and coronoids, including ``snowflakes and ``laceflowers
- Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs
- Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system
- A min-max theorem for plane bipartite 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 Q3813828)
