Combinatorics, Discrete mathematics, Chordal graph, Indifference graph and Maximal independent set are his primary areas of study. His Combinatorics study focuses mostly on Forbidden graph characterization, Treewidth, Vertex, Induced subgraph and Line graph. All of his Discrete mathematics and Cograph, Bipartite graph, Independent set, Split graph and Partial k-tree investigations are sub-components of the entire Discrete mathematics study.
The study incorporates disciplines such as Pathwidth and Vertex cover in addition to Chordal graph. His Modular decomposition research extends to the thematically linked field of Indifference graph. His Maximal independent set study typically links adjacent topics like Strong perfect graph theorem.
His primary areas of study are Combinatorics, Discrete mathematics, Chordal graph, Indifference graph and Independent set. Maximal independent set, Graph, Bipartite graph, Pathwidth and Induced subgraph are the primary areas of interest in his Combinatorics study. His study in Maximal independent set is interdisciplinary in nature, drawing from both Longest path problem, Vertex cover and Metric dimension.
Cograph, Split graph, 1-planar graph, Forbidden graph characterization and Clique-width are subfields of Discrete mathematics in which his conducts study. As a member of one scientific family, Vadim V. Lozin mostly works in the field of Chordal graph, focusing on Treewidth and, on occasion, Partial k-tree. The various areas that Vadim V. Lozin examines in his Indifference graph study include Modular decomposition, Clique-sum and Trapezoid graph.
Combinatorics, Discrete mathematics, Graph, Conjecture and Clique-width are his primary areas of study. His Combinatorics study is mostly concerned with Induced subgraph, Independent set, Well-quasi-ordering, Time complexity and Bipartite graph. Many of his studies on Discrete mathematics apply to Graph as well.
His work in Graph addresses subjects such as Ramsey theory, which are connected to disciplines such as Neighbourhood, Vertex cover, Exponential function and Entropy. His Maximal independent set research includes themes of Matching, Dense graph and Metric dimension. His research brings together the fields of Indifference graph and Cograph.
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Clique-width, Induced subgraph and Graph. His Combinatorics study focuses mostly on Time complexity, Dominating set, Conjecture, Bell number and Coloring problem. The Cograph, Independent set and Maximal independent set research he does as part of his general Discrete mathematics study is frequently linked to other disciplines of science, such as Atlas and Zoom, therefore creating a link between diverse domains of science.
In the field of Chordal graph and Pathwidth Vadim V. Lozin studies Cograph. His research on Maximal independent set often connects related topics like Indifference graph. His Clique-width study which covers Well-quasi-ordering that intersects with Triangle-free graph and Distance-hereditary graph.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Deciding k -Colorability of P 5 -Free Graphs in Polynomial Time
Chính T. Hoàng;Marcin Kamiński;Vadim Lozin;Joe Sawada.
Recent developments on graphs of bounded clique-width
Marcin Kamiński;Vadim V. Lozin;Martin Milanič.
Discrete Applied Mathematics (2009)
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Vadim V. Lozin;Martin Milanič.
Journal of Discrete Algorithms (2008)
On maximum induced matchings in bipartite graphs
Vadim V. Lozin.
Information Processing Letters (2002)
Coloring edges and vertices of graphs without short or long cycles
Vadim V. Lozin;Marcin Kaminski.
Contributions to Discrete Mathematics (2007)
NP-hard graph problems and boundary classes of graphs
V. E. Alekseev;R. Boliac;D. V. Korobitsyn;V. V. Lozin.
Theoretical Computer Science (2007)
On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
V. Lozin;D. Rautenbach.
SIAM Journal on Discrete Mathematics (2005)
On the linear structure and clique-width of bipartite permutation graphs.
Andreas Brandstädt;Vadim V. Lozin.
Ars Combinatoria (2003)
Clique-Width for 4-Vertex Forbidden Subgraphs
Andreas Brandstadt;Joost Engelfriet;Hoang-Oanh Le;Vadim V. Lozin.
Theory of Computing Systems / Mathematical Systems Theory (2006)
Some results on graphs without long induced paths
Vadim Lozin;Dieter Rautenbach.
Information Processing Letters (2003)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: