Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Malyshev, Dmitriy"'
The class of quasi-chain graphs is an extension of the well-studied class of chain graphs. This latter class enjoys many nice and important properties, such as bounded clique-width, implicit representation, well-quasi-ordering by induced subgraphs, e
Externí odkaz:
http://arxiv.org/abs/2104.04471
The class of bipartite permutation graphs enjoys many nice and important properties. In particular, this class is critically important in the study of clique- and rank-width of graphs, because it is one of the minimal hereditary classes of graphs of
Externí odkaz:
http://arxiv.org/abs/2010.14467
Weighted independent domination is an NP-hard graph problem, which remains computationally intractable in many restricted graph classes. In particular, the problem is NP-hard in the classes of sat-graphs and chordal graphs. We strengthen these result
Externí odkaz:
http://arxiv.org/abs/1602.09124
Autor:
Malyshev, Dmitriy
The coloring problem is studied in the paper for graph classes defined by two small forbidden induced subgraphs. We prove some sufficient conditions for effective solvability of the problem in such classes. As their corollary we determine the computa
Externí odkaz:
http://arxiv.org/abs/1307.0278
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Theoretical Computer Science 14 November 2017 700:63-74
Publikováno v:
Journal of Graph Theory; Jan2024, Vol. 105 Issue 1, p34-60, 27p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Taletskii Dmitrii, Malyshev Dmitriy
Publikováno v:
Discrete Mathematics and Applications. 31:135-144
A complete description of trees with maximal possible number of maximum independent sets among all n-vertex trees with exactly l leaves is obtained. For all values of the parameters n and l the extremal tree is unique and is the result of merging the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::381a7a8f7bd4d893e132e39b08a99acc
https://doi.org/10.1515/dma-2021-0012
https://doi.org/10.1515/dma-2021-0012
Publikováno v:
Leibniz International Proceedings in Informatics, LIPIcs
A temporal graph G = (G_1, G_2, ..., G_T) is a graph represented by a sequence of T graphs over a common set of vertices, such that at the i-th time step only the edge set E_i is active. The temporal graph exploration problem asks for a shortest temp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7aa8b28fa34839074720b2c585f2c4bd
http://livrepository.liverpool.ac.uk/3156375/1/main.pdf
http://livrepository.liverpool.ac.uk/3156375/1/main.pdf