Search

Your search keyword '"I. G. Dmitriev"' showing total 4 results
Start Over Author "I. G. Dmitriev"
4 results on '"I. G. Dmitriev"'

1. Thirteen Papers in Algebra

Author

I. G. Dmitriev, S. Kh. Darbinyan, A. V. Kostochka, O. G. Rudenskaya, T. M. Zuparov, V. V. Iliev, D. A. Leĭtes, V. Ya. Golodets, N. I. Nessonov, I. S. Bezverkhnyaya, V. A. Grinblat, N. A. Vavilov, A. L. Vishnevetskiĭ, I. G. Dmitriev, S. Kh. Darbinyan, A. V. Kostochka, O. G. Rudenskaya, T. M. Zuparov, V. V. Iliev, D. A. Leĭtes, V. Ya. Golodets, N. I. Nessonov, I. S. Bezverkhnyaya, V. A. Grinblat, N. A. Vavilov, and A. L. Vishnevetskiĭ

Subjects
Algebra
Abstract

The topics in this collection range over several diverse areas, such as graph theory, continued fractions, complex manifolds, and group theory.

Published
2016

2. The height of a 4-cycle in triangle-free 1-planar graphs with minimum degree 5

Author

Oleg V. Borodin, I. G. Dmitriev, and Anna O. Ivanova

Subjects
Discrete mathematics, Applied Mathematics, Symmetric graph, Neighbourhood (graph theory), Quartic graph, Industrial and Manufacturing Engineering, Planar graph, Combinatorics, symbols.namesake, Frequency partition of a graph, Outerplanar graph, Wheel graph, symbols, Regular graph, Mathematics
Abstract

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. It is known that each 1-planar graph has a vertex of degree at most 7, and also either a vertex of degree at most 4 or a cycle of length at most 4. In the article, it is proven that each triangle-free 1-planar graph of degree less than 5 has a 4-cycle that consists of vertices of degree at most 8.

Published
2009

3. A characterization of chromatically rigid polynomials

Author

O. V. Vorodin and I. G. Dmitriev

Subjects
Connected component, Discrete mathematics, Combinatorics, Coxeter graph, Foster graph, Windmill graph, General Mathematics, Friendship graph, Star (graph theory), Chromatic polynomial, Butterfly graph, Mathematics
Published
1991

Catalog

Books, media, physical & digital resources
See catalog results