Zobrazeno 1 - 10
of 66
pro vyhledávání: '"Yolov, A. A."'
Autor:
Yolov, Nikola
In this paper we present a new width measure for a tree decomposition, minor-matching hypertree width, $\mu\text{-}tw$, for graphs and hypergraphs, such that bounding the width guarantees that set of maximal independent sets has a polynomially-sized
Externí odkaz:
http://arxiv.org/abs/1704.02939
Autor:
Yolov, Nikola
Finding the maximum number of maximal independent sets in an $n$-vertex graph $G$, $i(G)$, from a restricted class is an extensively studied problem. Let $kK_2$ denote the matching of size $k$, that is a graph with $2k$ vertices and $k$ disjoint edge
Externí odkaz:
http://arxiv.org/abs/1606.06263
Autor:
McDiarmid, Colin, Yolov, Nikola
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 partition of a graph can be used to find efficiently the clique numbe
Externí odkaz:
http://arxiv.org/abs/1604.00922
Autor:
Yolov, Nikola
We sharpen the result that polarity and monopolarity are NP-complete problems by showing that they remain NP-complete if the input graph is restricted to be a $3$-colourable comparability graph. We start by presenting a construction reducing $1$-$3$-
Externí odkaz:
http://arxiv.org/abs/1604.00905
Autor:
McDiarmid, Colin, Yolov, Nikola
We present a tight extremal threshold for the existence of Hamilton cycles in graphs with large minimum degree and without a large ``bipartite hole`` (two disjoint sets of vertices with no edges between them). This result extends Dirac's classical th
Externí odkaz:
http://arxiv.org/abs/1604.00888
Autor:
McDiarmid, Colin, Yolov, Nikola
We investigate the asymptotic structure of a random perfect graph $P_n$ sampled uniformly from the perfect graphs on vertex set $\{1,\ldots,n\}$. Our approach is based on the result of Pr\"omel and Steger that almost all perfect graphs are generalise
Externí odkaz:
http://arxiv.org/abs/1604.00890
Autor:
Yolov, Vladimir
Publikováno v:
Власт, управление и обществено развитие : Глобални, регионални и национални перспективи : Международна научно-практическа конференция, 7 юни 2017 / Authority, governance and societal development : Global, regional and national perspectives : International scientific-applied conference, 7 June 2017. :429-436
Externí odkaz:
https://www.ceeol.com/search/chapter-detail?id=645682
Autor:
Colin McDiarmid, Nikola Yolov
Publikováno v:
Algorithms, Vol 8, Iss 1, Pp 46-59 (2015)
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 partition of a graph can be used to find efficiently the clique numbe
Externí odkaz:
https://doaj.org/article/342a351cb4294b0e93e6f551e8ddf8f3
Autor:
Yolov, Vladimir
Обект на изследването са българските филиали на международните търговски вериги BILLA, H&M и Deichmann. Предмет на изследването са теоретико-мет
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______9626::1d26d370d12bc86ca35dd85b0dbb5c94
https://hdl.handle.net/20.500.12641/12366
https://hdl.handle.net/20.500.12641/12366