Smallest maximal matchings of graphs

DOI10.15672/hujms.1095437zbMath1524.05244OpenAlexW4306406274MaRDI QIDQ6100387

Unnamed Author, Tomislav Došlić

Publication date: 22 June 2023

Published in: Hacettepe Journal of Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15672/hujms.1095437

zbMATH Keywords

independent domination numbermaximal matchingsaturation numberproduct graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On domination and independent domination numbers of a graph
• Saturation number of fullerene graphs
• Matching theory
• Small maximal matchings in random graphs.
• The chromatic number and other functions of the lexicographic product
• Tight bounds on maximal and maximum matchings
• Independent domination in graphs: A survey and recent results
• Counting maximal matchings in linear polymers
• Minimum Edge Dominating Sets
• Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
• Edge Dominating Sets in Graphs
• Block allocation of a sequential resource
• Sandwiching saturation number of fullerene graphs
• Saturation number of nanotubes

This page was built for publication: Smallest maximal matchings of graphs