scientific article; zbMATH DE number 7822853

arXiv2202.07929MaRDI QIDQ6200548

Zakir Deniz, Tınaz Ekim

Publication date: 22 March 2024

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

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

zbMATH Keywords

maximal matchingwell-covered graphs with no shedding vertex

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity
• Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
• Bounding the size of equimatchable graphs of fixed genus
• Matching theory
• Equimatchable claw-free graphs
• Equimatchable bipartite graphs
• 1-well-covered graphs revisited
• Edge-stable equimatchable graphs
• Vertex decomposable graphs and obstructions to shellability
• Equimatchable Graphs on Surfaces
• Edge Dominating Sets in Graphs
• On some subclasses of well-covered graphs
• Randomly matchable graphs
• On Minimum Maximal Distance-k Matchings
• Equimatchable Regular Graphs
• Equimatchable factor‐critical graphs
• Some covering concepts in graphs
• Triangle‐free equimatchable graphs

This page was built for publication: