activity
20102013
most citedOn the principal impossibility to prove P=NP

3 citations · 3 across the 6 of their papers we have counts for

collaborators

6 papers

cs.DM2013

The chromatic class and the chromatic number of the planar conjugated triangulation

Natalia Malinina

This material is dedicated to the estimation of the chromatic number and chromatic class of the conjugated triangulation (first conversion) and also of the second conversion of the…

cs.DM2013

Special Partial Graphs

Natalia Malinina

The attempts to prove the Four Color Problem last for long years. A little hope arises that the properties of the minimal partial triangulations will be very useful for the solutio…

cs.DM2012

Properties of the dual planar triangulations

Natalia Malinina

This article is devoted to the properties of the planar triangulations. The conjugated planar triangulation will be introduced and on the base of the properties, which were achieve…

cs.CC2012★ 3 cited

On the principal impossibility to prove P=NP

Natalia L. Malinina

The material of the article is devoted to the most complicated and interesting problem -- a problem of P = NP?. This research was presented to mathematical community in Hyderabad d…

math.GM2012

A Converting of the Directed Graphs

Leonid Malinin, Natalia Malinina

The presented material continues the previous article (arxiv:1007.1059) and also is devoted to the equivalent conversion between the graphs. The examining of the transformation of…

cs.CC2010

On the solution of the Graph Isomorphism Problem Part 1

Leonid Malinin, Natalia Malinina

The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism o…