Global forcing number for maximal matchings

DOI10.1016/j.disc.2017.12.002zbMath1378.05174OpenAlexW2777772038MaRDI QIDQ1690248

Tomislav Došlić, Shou-Jun Xu, Jelena Sedlar, Damir Vukičević, Shuang Zhao

Publication date: 19 January 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.12.002

zbMATH Keywords

maximal matchingglobal forcing setglobal forcing number

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

Global forcing number for maximal matchings in corona products, \(l\)-clique metric dimension of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Twelve countings with rooted plane trees
• The global forcing number of the parallelogram polyhex
• On the number of matchings of a tree
• Matching theory
• The minimum forcing number for the torus and hypercube
• Forcing matchings on square grids
• On the forced matching numbers of bipartite graphs
• Hexagonal systems with forcing edges
• Global forcing number of benzenoid graphs
• Counting maximal matchings in linear polymers
• Equimatchable Graphs on Surfaces
• Randomly matchable graphs
• On the spectrum of the forced matching number of graphs