24 results on '"MALYSHEV, D."'
Search Results
2. On a Countable Family of Boundary Graph Classes for the Dominating Set Problem
3. Some Cases of Polynomial Solvability of the Edge Coloring Problem That Are Generated by Forbidden 8-Edge Subcubic Forests
4. Efficient Solvability of the Weighted Vertex Coloring Problem for Some Two Hereditary Graph Classes
5. Complete Complexity Dichotomy for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\boldsymbol 7 $$\end{document}-Edge Forbidden Subgraphs in the Edge Coloring Problem
6. Efficient Solvability of the Weighted Vertex Coloring Problem for Some Hereditary Class of Graphs with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\boldsymbol {5}$$\end{document} -Vertex Prohibitions
7. On the König Graphs for a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\boldsymbol 5 $$\end{document}-Path and Its Spanning Supergraphs
8. Minimization of Even Conic Functions on the Two-Dimensional Integral Lattice
9. A Complete Complexity Dichotomy of the Edge-Coloring Problem for All Sets of $$8$$-Edge Forbidden Subgraphs
10. König Graphs with Respect to the 4-Path and Its Spanning Supergraphs
11. On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size
12. Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs
13. Critical elements in combinatorially closed families of graph classes
14. Classes of graphs critical for the edge list-ranking problem
15. Classes of subcubic planar graphs for which the independent set problem is polynomially solvable
16. Expanding operators for the independent set problem
17. A study of the boundary graph classes for colorability problems
18. On the infinity of the set of boundary classes for the edge 3-colorability problem
19. Planar graph classes with the independent set problem solvable in polynomial time
20. Analysis of the impact of the number of edges in connected graphs on the computational complexity of the independent set problem
21. Complete Complexity Dichotomy for $$\boldsymbol 7 $$-Edge Forbidden Subgraphs in the Edge Coloring Problem
22. Efficient Solvability of the Weighted Vertex Coloring Problem for Some Hereditary Class of Graphs with $$\boldsymbol {5}$$ -Vertex Prohibitions
23. On the König Graphs for a $$\boldsymbol 5 $$-Path and Its Spanning Supergraphs
24. On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.