Didem Gözüpek

Available identifiers

zbMath Open gozupek.didemMaRDI QIDQ248935

List of research outcomes

Publication	Date of Publication	Type
Well-indumatched pseudoforests	2025-01-06	Paper
Parameterized complexity of finding a spanning tree with minimum reload cost diameter	2023-11-15	Paper
Triangle‐free equimatchable graphs	2023-10-05	Paper
Equimatchable bipartite graphs	2022-12-02	Paper
Paired domination versus domination and packing number in graphs	2022-08-19	Paper
\((C_3, C_4, C_5, C_7)\)-free almost well-dominated graphs	2022-07-26	Paper
Well-totally-dominated graphs	2022-03-24	Paper
Upper paired domination versus upper domination	2022-01-27	Paper
Edge-Critical Equimatchable Bipartite Graphs	2021-12-08	Paper
Minimum reload cost graph factors	2021-08-05	Paper
Almost well-dominated bipartite graphs with minimum degree at least two	2021-07-27	Paper
On graphs all of whose total dominating sequences have the same length	2021-07-08	Paper
Minimum reload cost graph factors	2020-10-22	Paper
Total $k$-Uniform Graphs	2020-10-16	Paper
Mind the independence gap	2020-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q5111862	2020-05-27	Paper
Minimum reload cost cycle cover in complete graphs	2019-10-31	Paper
Complexity of edge coloring with minimum reload/changeover costs	2019-07-30	Paper
On a Class of Graphs with Large Total Domination Number	2018-12-10	Paper
On Almost Well-Covered Graphs of Girth at Least 6	2018-12-10	Paper
On one extension of Dirac's theorem on Hamiltonicity	2018-12-10	Paper
Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs	2018-11-30	Paper
Equimatchable claw-free graphs	2018-08-15	Paper
On matching extendability of lexicographic products	2018-02-23	Paper
Parameterized complexity of the MinCCA problem on graphs of bounded decomposability	2017-08-24	Paper
Parameterized complexity of the MinCCA problem on graphs of bounded decomposability	2016-12-22	Paper
Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)	2016-08-16	Paper
Constructing minimum changeover cost arborescenses in bounded treewidth graphs	2016-02-26	Paper
On the complexity of constructing minimum changeover cost arborescences	2014-06-06	Paper

Research outcomes over time

This page was built for person: Didem Gözüpek