Some bounds on the maximum induced matching numbers of certain grids

zbMath1414.05236arXiv1603.06967MaRDI QIDQ5383192

Deborah Olayide A. Ajayi, Tayo Charles Adefokun

Publication date: 20 June 2019

Full work available at URL: https://arxiv.org/abs/1603.06967

zbMATH Keywords

gridsinduced matchingmaximum induced matching number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items

On the radio number for corona of paths and cycles

Cites Work

• Unnamed Item
• Irredundancy in circular arc graphs
• NP-completeness of some generalizations of the maximum matching problem
• Induced matchings in intersection graphs.
• Finding a maximum induced matching in weakly chordal graphs
• New results on maximum induced matchings in bipartite graphs and beyond
• Induced Matchings in Graphs of Bounded Maximum Degree
• Maximum Induced Matchings in Grids
• Paths, Trees, and Flowers
• Induced Matchings in Graphs of Degree at Most 4