‪Sándor Kisfaludi-Bak

collaborators

2 papers

math.CO2014

5 Colorable Visibility Graphs Have Bounded Size or 4 Collinear Points

Bálint Hujter, Sándor Kisfaludi-Bak

We investigate the question of finding a bound for the size of a $χ$ -colorable finite visibility graph that has at most $ℓ$ collinear points. This can be regarded as a relaxed v…

cs.DS2014

Notes on dual-critical graphs

Zoltán Király, Sándor Kisfaludi-Bak

We define dual-critical graphs as graphs having an acyclic orientation, where the indegrees are odd except for the unique source. We have very limited knowledge about the complexit…