scientific article; zbMATH DE number 2152546

zbMath1063.05074MaRDI QIDQ4664109

Jelena Sedlar, Damir Vukičević

Publication date: 5 April 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

triangular gridperfect matchingsextremal problemforcing matchings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (12)

Complete forcing numbers of hexagonal systems. II ⋮ Complete forcing numbers of primitive coronoids ⋮ Complete forcing numbers of complete and almost-complete multipartite graphs ⋮ Global forcing number for maximal matchings ⋮ On forcing matching number of boron-nitrogen fullerene graphs ⋮ On the anti-forcing number of benzenoids ⋮ The global forcing number of the parallelogram polyhex ⋮ On the global forcing number of hexagonal systems ⋮ Complete forcing numbers of hexagonal systems ⋮ Relations between global forcing number and maximum anti-forcing number of a graph ⋮ Complete forcing numbers of catacondensed hexagonal systems ⋮ Complete forcing numbers of graphs

This page was built for publication: