ON MATCHING EXTENDABILITY OF LEXICOGRAPHIC PRODUCTS
| dc.contributor.author | Chiarelli, Nina | |
| dc.contributor.author | Dibek, Cemil | |
| dc.contributor.author | Ekim, Tinaz | |
| dc.contributor.author | Gözüpek, Didem | |
| dc.contributor.author | Miklavic, Stefko | |
| dc.date.accessioned | 2025-10-29T11:19:35Z | |
| dc.date.issued | 2017 | |
| dc.department | Fakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü | |
| dc.description.abstract | A graph G of even order is l-extendable if it is of order at least 2l + 2, contains a matching of size l, and if every such matching is contained in a perfect matching of G. In this paper, we study the extendability of lexicographic products of graphs. We characterize graphs G and H such that their lexicographic product is not 1-extendable. We also provide several conditions on the graphs G and H under which their lexicographic product is 2-extendable. | |
| dc.description.sponsorship | TUBITAK-ARRS [213M620] | |
| dc.description.sponsorship | Slovenian Research Agency [P1-0285, N1-0032, N1-0038, J1-5433, J1-6720, J1-7051] | |
| dc.description.sponsorship | This work has been supported by TUBITAK-ARRS under grant number 213M620. It is also supported in part by the Slovenian Research Agency (research program P1-0285 and research projects N1-0032, N1-0038, J1-5433, J1-6720, J1-7051). | |
| dc.identifier.doi | 10.1051/ro/2016072 | |
| dc.identifier.endpage | 873 | |
| dc.identifier.issn | 0399-0559 | |
| dc.identifier.issn | 1290-3868 | |
| dc.identifier.issue | 3 | |
| dc.identifier.orcid | 0000-0002-7162-9581 | |
| dc.identifier.orcid | 0000-0002-1171-9294 | |
| dc.identifier.scopus | 2-s2.0-85030719153 | |
| dc.identifier.scopusquality | Q2 | |
| dc.identifier.startpage | 857 | |
| dc.identifier.uri | https://doi.org/10.1051/ro/2016072 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14854/8233 | |
| dc.identifier.volume | 51 | |
| dc.identifier.wos | WOS:000412095600021 | |
| dc.identifier.wosquality | Q4 | |
| dc.indekslendigikaynak | Web of Science | |
| dc.indekslendigikaynak | Scopus | |
| dc.language.iso | en | |
| dc.publisher | Edp Sciences S A | |
| dc.relation.ispartof | Rairo-Operations Research | |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.snmz | KA_WOS_20251020 | |
| dc.subject | l-extendable graphs | |
| dc.subject | lexicographic product | |
| dc.subject | Tutte's Theorem | |
| dc.title | ON MATCHING EXTENDABILITY OF LEXICOGRAPHIC PRODUCTS | |
| dc.type | Article |
