Triangle‐free equimatchable graphs

DOI10.1002/jgt.22750zbMath1522.05367arXiv1807.09520OpenAlexW3203541725MaRDI QIDQ6057652

Sibel Özkan, Didem Gözüpek, Yasemin Büyükçolak

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

girthtriangle-freefactor-criticalgraph familiesequimatchable

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (3)

On well-edge-dominated graphs ⋮ Graphs with each edge in at most one maximum matching ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Finding and counting given length cycles
• Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
• Matching-perfect and cover-perfect graphs
• The structure of well-covered graphs and the complexity of their recognition problems
• Equimatchable claw-free graphs
• Efficient recognition of equimatchable graphs
• Powers of tensors and fast matrix multiplication
• Equimatchable Graphs on Surfaces
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Matchings in polytopal graphs
• Randomly matchable graphs
• Equimatchable Regular Graphs
• Equimatchable factor‐critical graphs

This page was built for publication: Triangle‐free equimatchable graphs