Forcing hexagons in hexagonal systems

MaRDI QIDQ5310110zbMATH OpenFDO

Authors Zhongyuan Che, Zhibo Chen

Publication date 8 October 2007

zbMATH Keywords

perfect matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• Hexagonal systems with forcing edges
• Hexagonal systems with forcing single edges
• Complete forcing numbers of hexagonal systems
• Complete forcing numbers of hexagonal systems. II
• Matching forcing polynomials of constructable hexagonal systems

Cited in

(12)

• Forcing faces in plane bipartite graphs
• Plane elementary bipartite graphs with forcing or anti-forcing edges
• Packing resonant hexagons in fullerenes
• Continuous forcing spectra of even polygonal chains
• On the global forcing number of hexagonal systems
• Hexagonal systems with forcing edges
• Matching forcing polynomials of constructable hexagonal systems
• Complete forcing numbers of hexagonal systems
• Removable and forced subgraphs of graphs
• Even cycles and perfect matchings in claw-free plane graphs
• The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes
• Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey

This page was built for publication: Forcing hexagons in hexagonal systems

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