scientific article; zbMATH DE number 6749525

zbMath1462.05294MaRDI QIDQ5279120

Tomislav Došlić, Ivana Zubac

Publication date: 19 July 2017

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

zbMATH Keywords

smallest maximal matchingsaturation number of a graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Related Items (8)

A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems ⋮ Global forcing number for maximal matchings ⋮ Smallest maximal matchings of graphs ⋮ Counting the maximal and perfect matchings in benzenoid chains ⋮ Saturation number of lattice animals ⋮ M-polynomials and topological indices of linear chains of benzene, napthalene and anthracene ⋮ On some parameters related to matching of graph powers ⋮ Maximal matchings in polyspiro and benzenoid chains

This page was built for publication: