The following pages link to Tınaz Ekim (Q266808):
Displaying 50 items.
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- Graphs of edge-intersecting and non-splitting paths (Q288788) (← links)
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I (Q323036) (← links)
- (Q509887) (redirect page) (← links)
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888) (← links)
- On three extensions of equimatchable graphs (Q510986) (← links)
- Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded (Q512562) (← links)
- Recognizing line-polar bipartite graphs in time \(O(n)\) (Q602675) (← links)
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) (Q738850) (← links)
- Mind the independence gap (Q776261) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- (Q943778) (redirect page) (← links)
- Construction of balanced sports schedules using partitions into subleagues (Q943779) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- Polarity of chordal graphs (Q955313) (← links)
- On split-coloring problems (Q995923) (← links)
- Partitioning graphs into complete and empty graphs (Q1045126) (← links)
- Equimatchable claw-free graphs (Q1660273) (← links)
- The maximum cardinality cut problem in co-bipartite chain graphs (Q1698075) (← links)
- Advances on defective parameters in graphs (Q1751109) (← links)
- On two extensions of equimatchable graphs (Q1751251) (← links)
- Integer programming formulations for the minimum weighted maximal matching problem (Q1758060) (← links)
- Perfectness of clustered graphs (Q1799385) (← links)
- Polar permutation graphs are polynomial-time recognisable (Q1933641) (← links)
- Some defective parameters in graphs (Q1950405) (← links)
- Small 1-defective Ramsey numbers in perfect graphs (Q2010929) (← links)
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation (Q2025063) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- On the maximum cardinality cut problem in proper interval graphs and related graph classes (Q2055967) (← links)
- Exact values of defective Ramsey numbers in graph classes (Q2067502) (← links)
- The complexity of the defensive domination problem in special graph classes (Q2279988) (← links)
- Efficient recognition of equimatchable graphs (Q2350604) (← links)
- Complexity of the improper twin edge coloring of graphs (Q2409501) (← links)
- Edge-stable equimatchable graphs (Q2414461) (← links)
- Corrigendum to ``Polar cographs'' (Q2449119) (← links)
- Partitioning cographs into cliques and stable sets (Q2568333) (← links)
- Construction of sports schedules with multiple venues (Q2581559) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)
- Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs (Q2689127) (← links)
- Defensive domination in proper interval graphs (Q2691568) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations (Q2864295) (← links)
- Computing Minimum Geodetic Sets of Proper Interval Graphs (Q2894472) (← links)
- Block decomposition approach to compute a minimum geodetic set (Q2928426) (← links)
- Hardness and approximation of minimum maximal matchings (Q2935383) (← links)
- Well-totally-dominated graphs (Q3390049) (← links)
- (p, k)-coloring problems in line graphs (Q3439661) (← links)
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs (Q3502661) (← links)
- Polar Permutation Graphs (Q3651548) (← links)
- Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid (Q4558956) (← links)
