Oleg Duginov

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs Diskretnyĭ Analiz i Issledovanie Operatsiĭ	2024-11-27	Paper
Partitioning the edge set of a bipartite graph into the minimal number of subgraphs isomorphic to those of a simple 4 order cycle	2024-02-13	Paper
scientific article; zbMATH DE number 7656024 (Why is no real title available?)	2023-02-21	Paper
A weighted perfect matching with constraints on weights of its parts Diskretnyi analiz i issledovanie operatsii	2022-08-29	Paper
Bottleneck subset-type restricted matching problems Journal of Combinatorial Optimization	2021-05-03	Paper
Problems and invariants connected with bicliques and multicliques of graphs	2018-10-24	Paper
On biclique covering number of the Cartesian product of graphs	2018-10-24	Paper
The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs	2018-10-24	Paper
Computation of the biclique partition number for graphs with specific blocks	2018-10-24	Paper
Secure total domination in graphs: bounds and complexity Discrete Applied Mathematics	2018-09-25	Paper
Clustering minimum biclique completion of a bipartite graph	2017-10-18	Paper
Polynomially solvable cases of the minimum biclique vertex-cover problem	2017-10-18	Paper
On the biclique partition of the corona and joins of graphs	2017-07-14	Paper
Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs Discrete Mathematics and Theoretical Computer Science. DMTCS	2014-11-10	Paper
Algorithms for finding biclique covers of graphs with bounded pathwidth Trudy Instituta Matematiki	2012-09-05	Paper

Research outcomes over time

This page was built for person: Oleg Duginov