@article {1542,
	title = {An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs},
	journal = {European Journal of Operational Research},
	volume = {291(1)},
	year = {2021},
	pages = {67{\textendash}83},
	doi = {https://doi.org/10.1016/j.ejor.2020.09.017},
	author = {Oylum {\c S}eker and Ekim, Tinaz and Z C Ta{\c s}k{\i}n}
}
@article {1501,
	title = {Edge-stable equimatchable graphs},
	journal = {Discrete Applied Mathematics},
	volume = {261},
	year = {2019},
	pages = {136-147},
	abstract = {<p>A graph G is equimatchable if every maximal matching of G has the same cardinality. We are interested in equimatchable graphs such that the removal of any edge from the graph preserves the equimatchability. We call an equimatchable graph G edge-stable if G\e, that is the graph obtained by the removal of edge e from G, is also equimatchable for any e∈E(G). After noticing that edge-stable equimatchable graphs are either 2-connected factor-critical or bipartite, we characterize edge-stable equimatchable graphs. This characterization yields an O(min(n3.376,n1.5m)) time recognition algorithm. Lastly, we introduce and shortly discuss the related notions of edge-critical, vertex-stable and vertex-critical equimatchable graphs. In particular, we emphasize the links between our work and the well-studied notion of shedding vertices, and point out some open questions.</p>},
	keywords = {1-well-covered, Edge-criticality, Edge-stability, Maximal matching, Shedding vertex},
	issn = {0166-218X},
	doi = {https://doi.org/10.1016/j.dam.2018.09.033},
	url = {https://www.sciencedirect.com/science/article/pii/S0166218X18305158},
	author = {Zakir Deniz and Ekim, Tinaz}
}
@article {1509,
	title = {Equimatchable claw-free graphs},
	journal = {Discrete Mathematics},
	volume = {341},
	year = {2018},
	pages = {2859-2871},
	abstract = {<p>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.</p>},
	keywords = {Connectivity, Equimatchable graph, Factor-critical},
	issn = {0012-365X},
	doi = {https://doi.org/10.1016/j.disc.2018.06.043},
	url = {https://www.sciencedirect.com/science/article/pii/S0012365X18302140},
	author = {Saieed Akbari and Hadi Alizadeh and Ekim, Tinaz and Didem G{\"o}z{\"u}pek and Mordechai Shalom}
}
@proceedings {1180,
	title = {Edge extremal Graphs Under Degree and Matching Number Restrictions},
	journal = {17th Haifa Workshop on Interdisciplinary Applications of Graphs {\textendash} CRI},
	year = {2017},
	author = {Ekim, Tinaz}
}
@article {1178,
	title = {Equimatchable graphs are C2k+ 1-free for k>= 4},
	journal = {Discrete Mathematics},
	volume = {339},
	year = {2016},
	pages = {2964{\textendash}2969},
	author = {Dibek, Cemil and Ekim, Tinaz and G{\"o}z{\"u}pek, Didem and Shalom, Mordechai}
}
@article {demange2014efficient,
	title = {Efficient recognition of equimatchable graphs},
	journal = {Information Processing Letters},
	volume = {114},
	number = {1},
	year = {2014},
	pages = {66{\textendash}71},
	publisher = {Elsevier},
	author = {Demange, Marc and Ekim, Tinaz}
}
