The following pages link to Didem Gözüpek (Q248935):
Displaying 27 items.
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) (Q738850) (← links)
- Mind the independence gap (Q776261) (← links)
- On one extension of Dirac's theorem on Hamiltonicity (Q1630770) (← links)
- Equimatchable claw-free graphs (Q1660273) (← links)
- On graphs all of whose total dominating sequences have the same length (Q2037571) (← links)
- Equimatchable bipartite graphs (Q2107742) (← links)
- \((C_3, C_4, C_5, C_7)\)-free almost well-dominated graphs (Q2158192) (← links)
- Paired domination versus domination and packing number in graphs (Q2165257) (← links)
- Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
- On the complexity of constructing minimum changeover cost arborescences (Q2453161) (← links)
- Well-totally-dominated graphs (Q3390049) (← links)
- Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs (Q4558969) (← links)
- On a Class of Graphs with Large Total Domination Number (Q4560247) (← links)
- On Almost Well-Covered Graphs of Girth at Least 6 (Q4560269) (← links)
- On matching extendability of lexicographic products (Q4603945) (← links)
- Almost well-dominated bipartite graphs with minimum degree at least two (Q5002317) (← links)
- Edge-Critical Equimatchable Bipartite Graphs (Q5014683) (← links)
- Upper paired domination versus upper domination (Q5024681) (← links)
- (Q5111862) (← links)
- Complexity of edge coloring with minimum reload/changeover costs (Q5226172) (← links)
- Minimum reload cost cycle cover in complete graphs (Q5241427) (← links)
- Minimum reload cost graph factors (Q5918369) (← links)
- Constructing minimum changeover cost arborescenses in bounded treewidth graphs (Q5964020) (← links)
- Triangle‐free equimatchable graphs (Q6057652) (← links)
- Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398) (← links)
- Well-indumatched pseudoforests (Q6657223) (← links)
- Grundy Packing Coloring of Graphs (Q6742570) (← links)
