|
|
Publications in Math-Net.Ru |
Citations |
|
2012 |
1. |
R. A. Petrovich, “The characterization of hereditary unigraphs on the canonical decomposition theory base”, Tr. Inst. Mat., 20:2 (2012), 93–102 |
2. |
R. A. Petrovich, “Relaxation of the famous $NP$-complete polar graphs recognition problem leading to the fast polynomial-time algorithm”, Tr. Inst. Mat., 20:1 (2012), 74–82 |
|
Organisations |
|
|