Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs

DOI10.1023/A:1021072722165zbMath1017.92046OpenAlexW13119440MaRDI QIDQ1861884

Heping Zhang, Wai Chee Shiu, Peter Che Bor Lam, Fu Ji Zhang

Publication date: 10 March 2003

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

Full work available at URL: https://doi.org/10.1023/a:1021072722165

zbMATH Keywords

Kekulé structureplane bipartite graphbenzenoidnormal componentClar pattern

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (16)

A minimax result for perfect matchings of a polyomino graph ⋮ The anti-Kekulé number of graphs ⋮ Decomposition theorem on matchable distributive lattices ⋮ Global forcing number of benzenoid graphs ⋮ Some novel minimax results for perfect matchings of hexagonal systems ⋮ Single coronoid systems with an anti-forcing edge ⋮ Forcing faces in plane bipartite graphs ⋮ \(Z\)-transformation graphs of perfect matchings of plane bipartite graphs ⋮ Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system ⋮ On the sextet polynomial of fullerenes ⋮ Counting clar structures of \((4,6)\)-fullerenes ⋮ The \(Z\)-transformation graph for an outerplane bipartite graph has a Hamilton path. ⋮ A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphs ⋮ Direct sum of distributive lattices on the perfect matchings of a plane bipartite graph ⋮ Perfect matchings in bipartite lattice animals: lower bounds and realizability ⋮ Anti-forcing numbers of perfect matchings of graphs

This page was built for publication: Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs