Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)

DOI10.1016/j.disc.2016.06.003zbMath1343.05121OpenAlexW2461993915MaRDI QIDQ738850

Mordechai Shalom, Cemil Dibek, Didem Gözüpek, Tınaz Ekim

Publication date: 16 August 2016

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

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

zbMATH Keywords

forbidden subgraphGallai-Edmonds decompositionfactor-criticalequimatchable graph

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 (4)

Edge-stable equimatchable graphs ⋮ Triangle‐free equimatchable graphs ⋮ Graphs with each edge in at most one maximum matching ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounding the size of equimatchable graphs of fixed genus
• Matching-perfect and cover-perfect graphs
• On two equimatchable graph classes
• Efficient recognition of equimatchable graphs
• Equimatchable Graphs on Surfaces
• Matchings in polytopal graphs
• Randomly matchable graphs
• WELL-COVERED GRAPHS: A SURVEY
• Equimatchable factor‐critical graphs

This page was built for publication: Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)