Defective Ramsey Numbers and Defective Cocolorings in Some Subclasses of Perfect Graphs von Demirci, Yunus Emre, Ekim, Tınaz, Yıldız, Mehmet Akif

Volltext

Maximum size of a triangle-free graph with bounded maximum degree and matching number von Ahanjideh, Milad, Ekim, Tınaz, Yıldız, Mehmet Akif

Volltext

The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation von Ekim, Tınaz, Shalom, Mordechai, Şeker, Oylum

Volltext

The maximum cardinality cut problem in co-bipartite chain graphs von Boyacı, Arman, Ekim, Tınaz, Shalom, Mordechai

Volltext

A decomposition approach to solve the selective graph coloring problem in some perfect graph families von Şeker, Oylum, Ekim, Tınaz, Taşkın, Z. Caner

Volltext

Edge-stable equimatchable graphs von Deniz, Zakir, Ekim, Tınaz

Volltext

On the maximum cardinality cut problem in proper interval graphs and related graph classes von Boyacı, Arman, Ekim, Tınaz, Shalom, Mordechai

Volltext

On some applications of the selective graph coloring problem von Demange, Marc, Ekim, Tınaz, Ries, Bernard, Tanasescu, Cerasela

Volltext

Defensive domination in proper interval graphs von Ekim, Tınaz, Farley, Arthur, Proskurowski, Andrzej, Shalom, Mordechai

Volltext

The complexity of the defensive domination problem in special graph classes von Ekim, Tınaz, Farley, Arthur M., Proskurowski, Andrzej

Volltext

Efficient recognition of equimatchable graphs von Demange, Marc, Ekim, Tınaz

Volltext

Advances on defective parameters in graphs von Akdemir, Ahu, Ekim, Tınaz

Volltext

An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs von Şeker, Oylum, Ekim, Tınaz, Taşkın, Z. Caner

Volltext

Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded von Dibek, Cemil, Ekim, Tınaz, Heggernes, Pinar

Volltext

Block decomposition approach to compute a minimum geodetic set von Ekim, Tınaz, Erey, Aysel

Volltext

Exact values of defective Ramsey numbers in graph classes von Demirci, Yunus Emre, Ekim, Tınaz, Gimbel, John, Yıldız, Mehmet Akif

Volltext

Constructing extremal triangle-free graphs using integer programming von Banak, Ali Erdem, Ekim, Tınaz, Taşkın, Z. Caner

Volltext

Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings von Izumi, Tomoko, Izumi, Taisuke, Kamei, Sayaka, Ooshita, Fukuhito

Volltext

Small 1-defective Ramsey numbers in perfect graphs von Ekim, Tınaz, Gimbel, John, Şeker, Oylum

Volltext

Equimatchable graphs are C2k+1-free for k≥4 von Dibek, Cemil, Ekim, Tınaz, Gözüpek, Didem, Shalom, Mordechai

Volltext