Equimatchable claw-free graphs
| dc.contributor.author | Akbari, Saieed | |
| dc.contributor.author | Alizadeh, Hadi | |
| dc.contributor.author | Ekim, Tinaz | |
| dc.contributor.author | Gözüpek, Didem | |
| dc.contributor.author | Shalom, Mordechai | |
| dc.date.accessioned | 2025-10-29T11:29:25Z | |
| dc.date.issued | 2018 | |
| dc.department | Fakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü | |
| dc.description.abstract | A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide the first characterization of claw-free equimatchable graphs by identifying the equimatchable claw-free graph families. This characterization implies an efficient recognition algorithm. (C)2018 Elsevier B.V. All rights reserved. | |
| dc.description.sponsorship | Istanbul Center for Mathematical Sciences (IMBM) | |
| dc.description.sponsorship | TUBITAK 2221 Programme | |
| dc.description.sponsorship | Part of the research of the first author was carried out while he was visiting Istanbul Center for Mathematical Sciences (IMBM) whose support is greatly acknowledged. The work of the fifth author is supported in part by the TUBITAK 2221 Programme. | |
| dc.identifier.doi | 10.1016/j.disc.2018.06.043 | |
| dc.identifier.endpage | 2871 | |
| dc.identifier.issn | 0012-365X | |
| dc.identifier.issn | 1872-681X | |
| dc.identifier.issue | 10 | |
| dc.identifier.orcid | 0000-0001-8994-8858 | |
| dc.identifier.orcid | 0000-0002-2688-5703 | |
| dc.identifier.orcid | 0000-0002-1171-9294 | |
| dc.identifier.orcid | 0000-0002-2693-7657 | |
| dc.identifier.orcid | 0000-0001-8450-1897 | |
| dc.identifier.scopus | 2-s2.0-85049972576 | |
| dc.identifier.scopusquality | Q2 | |
| dc.identifier.startpage | 2859 | |
| dc.identifier.uri | https://doi.org/10.1016/j.disc.2018.06.043 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14854/11088 | |
| dc.identifier.volume | 341 | |
| dc.identifier.wos | WOS:000443667100024 | |
| dc.identifier.wosquality | Q3 | |
| dc.indekslendigikaynak | Web of Science | |
| dc.indekslendigikaynak | Scopus | |
| dc.language.iso | en | |
| dc.publisher | Elsevier | |
| dc.relation.ispartof | Discrete Mathematics | |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.snmz | KA_WOS_20251020 | |
| dc.subject | Equimatchable graph | |
| dc.subject | Factor-critical | |
| dc.subject | Connectivity | |
| dc.title | Equimatchable claw-free graphs | |
| dc.type | Article |
