Minimum maximal matchings in phenylene chains

DOI10.46793/MATCH.96-3.33925MaRDI QIDQ7232976zbMATH OpenFDO

Authors Kai Deng, Ying Zhao, Xianyue Li

Publication date 23 April 2026

Published in MATCH - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46793/MATCH.96-3.33925

Mathematics Subject Classification ID

Biology and other natural sciences (92-XX)

Cites work

• An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
• Approximation hardness of edge dominating set problems
• Block allocation of a sequential resource
• Bounding and approximating minimum maximal matchings in regular graphs
• Domination versus edge domination
• Edge Dominating Sets in Graphs
• scientific article; zbMATH DE number 3781214 (Why is no real title available?)
• Integer programming formulations for the minimum weighted maximal matching problem
• Maximal matching and edge domination in complete multipartite graphs
• Minimum Edge Dominating Sets
• Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
• Minimum maximal matchings in cubic graphs
• Minimum-maximal matching in series-parallel graphs
• Sandwiching saturation number of fullerene graphs
• Saturation number of benzenoid graphs
• Saturation number of fullerene graphs
• Saturation number of lattice animals
• Saturation number of nanotubes
• Smallest maximal matchings in the graph of the d-dimensional cube
• Smallest maximal matchings of graphs
• The saturation number of carbon nanocones and nanotubes
• Tight bounds on maximal and maximum matchings

This page was built for publication: Minimum maximal matchings in phenylene chains

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