Speciality:
01.01.09 (Discrete mathematics and mathematical cybernetics)
Keywords: graph,
graph classes,
computational and approximation complexity.
UDC: 519.1
Subject:
Graph theory, combinatorial optimization, operations research
Main publications:
Duginov O., “Secure total domination in graphs: Bounds and complexity”, Discrete Applied Mathematics, 222 (2017), 97-108
Duginov O., “Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs”, Discrete Mathematics and Theoretical Computer Science, 16:3 (2014), 203-214