Nikola Yolov

According to our database, Nikola Yolov authored at least 6 papers between 2015 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Random perfect graphs.

Colin McDiarmid, Nikola Yolov

Random Struct. Algorithms, 2019

2018

Blocker size via matching minors.

Nikola Yolov

Discret. Math., 2018

Minor-matching hypertree width.

Nikola Yolov

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Hamilton Cycles, Minimum Degree, and Bipartite Holes.

Colin McDiarmid, Nikola Yolov

J. Graph Theory, 2017

2016

Polarity and Monopolarity of $3$-colourable comparability graphs.

Nikola Yolov

CoRR, 2016

2015

Recognition of Unipolar and Generalised Split Graphs.

Colin McDiarmid, Nikola Yolov

Algorithms, 2015