1 citations · 1 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017
Minor-matching hypertree width
Nikola Yolov
In this paper we present a new width measure for a tree decomposition, minor-matching hypertree width, , for graphs and hypergraphs, such that bounding the width guara…
cs.DS2016★ 1 cited
Recognition of unipolar and generalised split graphs
Colin McDiarmid, Nikola Yolov
A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar. A unipolar…