2 citations · 4 across the 10 of their papers we have counts for
10 papers
Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
Tomáš Masařík, Michał Włodarczyk, Mehmet Akif Yıldız
We consider the problem of partitioning the edges of a graph into as few paths as possible. This is a~subject of the classic conjecture of Gallai and a recurring topic in combinato…
Path decompositions of oriented graphs
Viresh Patel, Mehmet Akif Yıldız
We consider the problem of decomposing the edges of a digraph into as few paths as possible. A natural lower bound for the number of paths in any path decomposition of a digraph $D…
Cycle Partitions in Dense Regular Digraphs and Oriented Graphs
Allan Lo, Viresh Patel, Mehmet Akif Yıldız
A conjecture of Jackson from 1981 states that every -regular oriented graph on vertices with is Hamiltonian. We prove this conjecture for sufficiently large …
Maximum size of a triangle-free graph with bounded maximum degree and matching number
Milad Ahanjideh, Tınaz Ekim, Mehmet Akif Yıldız
Determining the maximum number of edges under degree and matching number constraints have been solved for general graphs by Chvátal and Hanson (1976), and by Balachandran and Khare…
Hamilton Cycles in Dense Regular Digraphs and Oriented Graphs
Allan Lo, Viresh Patel, Mehmet Akif Yıldız
We prove that for every there exists such that every regular oriented graph on vertices and degree at least $(1/4 + \varepsilon)n…
On a cover time problem on a dynamic graph with steps at random times
Yunus Emre Demirci, Ümit Işlak, Mehmet Akif Yıldız
We introduce a cover time problem for random walks on dynamic graphs in which the graph expands in time and the walker moves at random times. Time to cover all nodes and number of…
Defective Ramsey Numbers and Defective Cocolorings in Some Subclasses of Perfect Graphs
Yunus Emre Demirci, Tınaz Ekim, Mehmet Akif Yıldız
In this paper, we investigate a variant of Ramsey numbers called defective Ramsey numbers where cliques and independent sets are generalized to -dense and -sparse sets, both…
Defective Ramsey Numbers in Graph Classes
Yunus Emre Demirci, Tınaz Ekim, John Gimbel +1
Given a graph , a -sparse -set is a set of vertices inducing a subgraph with maximum degree at most . A -dense -set is a set of vertices that is -spars…
Linear Time Recognition of Equimatchable Split Graphs
Mehmet Akif Yıldız
A maximal matching that consists of independent edges is a subgraph of a simple and undirected graph for which forms an independent set. A graph is called equimat…
A study on random permutation graphs
Oğuz Gürerk, Ümit Işlak, Mehmet Akif Yıldız
For a given permutation in , a random permutation graph is formed by including an edge between two vertices and if and only if .…