Cemil Dibek

Available identifiers

Publication	Date of Publication	Type
Polynomial-time algorithm for maximum independent set in bounded-degree graphs with no long induced claws	2024-07-19	Paper
Sums of Separable and Quadratic Polynomials	2024-02-27	Paper
Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree	2024-01-29	Paper
A Sum of Squares Characterization of Perfect Graphs	2023-11-16	Paper
Strongly perfect claw‐free graphs—A short proof	2023-10-04	Paper
Graphs with polynomially many minimal separators	2021-11-17	Paper
New examples of minimal non-strongly-perfect graphs	2021-03-25	Paper
On matching extendability of lexicographic products	2018-02-23	Paper
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded	2017-02-27	Paper
Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)	2016-08-16	Paper
Submodular functions and perfect graphs	N/A	Paper

This page was built for person: Cemil Dibek