3 papers
math.CO2024
Chordal bipartite graphs, biclique vertex partitions and Castelnuovo-Mumford regularity of -subdivision graphs
Yusuf Civan, Zakir Deniz, Oleg Duginov +1
A biclique in a graph is a complete bipartite subgraph (not necessarily induced), and the least positive integer for which the vertex set of can be partitioned into at…
math.CO2020
Order-sensitive domination in partially ordered sets
Yusuf Civan, Zakir Deniz, Mehmet Akif Yetim
For a (finite) partially ordered set (poset) , we call a dominating set in the comparability graph of , an order-sensitive dominating set in if either or els…
math.CO2019
-Labeling of Graphs with Interval Representations
Mehmet Akif Yetim
We provide upper bounds on the -labeling number of graphs which have interval (or circular-arc) representations via simple greedy algorithms. We prove that there exists an…