Critical equimatchable graphs

arXiv2202.07929MaRDI QIDQ6200548FDOQ6200548

Authors: Zakir Deniz, Tınaz Ekim 

Publication date: 22 March 2024

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

Recommendations

• Equimatchable bipartite graphs
• Edge-stable equimatchable graphs
• Edge-Critical Equimatchable Bipartite Graphs
• Equimatchable factor‐critical graphs
• Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)

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

• Matching theory
• On some subclasses of well-covered graphs
• Some covering concepts in graphs
• Vertex decomposable graphs and obstructions to shellability
• Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity
• Edge Dominating Sets in Graphs
• Randomly matchable graphs
• Title not available (Why is that?)
• Equimatchable Graphs on Surfaces
• Bounding the size of equimatchable graphs of fixed genus
• Equimatchable factor‐critical graphs
• Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
• Equimatchable bipartite graphs
• Equimatchable claw-free graphs
• Edge-stable equimatchable graphs
• 1-well-covered graphs revisited
• Equimatchable regular graphs
• On minimum maximal distance-\(k\) matchings
• Triangle‐free equimatchable graphs

This page was built for publication: Critical equimatchable graphs

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