@article {1504,
	title = {Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II},
	journal = {Discrete Mathematics and Theoretical Computer Science},
	volume = {20},
	year = {2018},
	pages = {1b{\textendash}1b},
	author = {Boyac{\i}, Arman and Ekim, Tinaz and Shalom, Mordechai and Zaks, Shmuel}
}
@article {1502,
	title = {The maximum cardinality cut problem in co-bipartite chain graphs},
	journal = {Journal of Combinatorial Optimization},
	volume = {35},
	year = {2018},
	month = {Jan},
	pages = {250{\textendash}265},
	issn = {1382-6905},
	author = {Ekim, Tinaz and Boyac{\i}, Arman and Shalom, Mordechai}
}
@article {1178,
	title = {Equimatchable graphs are C2k+ 1-free for k>= 4},
	journal = {Discrete Mathematics},
	volume = {339},
	year = {2016},
	pages = {2964{\textendash}2969},
	author = {Dibek, Cemil and Ekim, Tinaz and G{\"o}z{\"u}pek, Didem and Shalom, Mordechai}
}
@article {1170,
	title = {Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes{\textemdash}Part I},
	journal = {Discrete Applied Mathematics},
	volume = {215},
	year = {2016},
	pages = {47{\textendash}60},
	author = {Boyac{\i}, Arman and Ekim, Tinaz and Shalom, Mordechai and Zaks, Shmuel}
}
@article {boyaci2013graphs,
	title = {Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations},
	year = {2013},
	author = {Boyac{\i}, Arman and Ekim, Tinaz and Shalom, Mordechai and Zaks, Shmuel}
}
