Equimatchable claw-free graphs
From MaRDI portal
Publication:1660273
DOI10.1016/j.disc.2018.06.043zbMath1393.05203arXiv1607.00476OpenAlexW2460958546MaRDI QIDQ1660273
Hadi Alizadeh, Saieed Akbari, Tınaz Ekim, Mordechai Shalom, Didem Gözüpek
Publication date: 15 August 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.00476
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
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
- Finding and counting small induced subgraphs efficiently
- Weighted well-covered claw-free graphs
- Finding and counting given length cycles
- Bounding the size of equimatchable graphs of fixed genus
- Matching-perfect and cover-perfect graphs
- On two equimatchable graph classes
- On 4-connected claw-free well-covered graphs
- Efficient recognition of equimatchable graphs
- Domination When the Stars Are Out
- Powers of tensors and fast matrix multiplication
- Graphs with 1-Factors
- Matchings in polytopal graphs
- On some subclasses of well-covered graphs
- Randomly matchable graphs
- A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
- Equimatchable factor‐critical graphs
- PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
- Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition
This page was built for publication: Equimatchable claw-free graphs
