|
|
Publications in Math-Net.Ru
-
Bipartite-threshold graphs and lifting rotations of edges in bipartite graphs
Trudy Inst. Mat. i Mekh. UrO RAN, 29:1 (2023), 24–35
-
On sequences of elementary transformations in the integer partitions lattice
Ural Math. J., 9:2 (2023), 36–45
-
Around the ErdÖs–Gallai criterion
Ural Math. J., 9:1 (2023), 29–48
-
An algorithm for taking a bipartite graph to the bipartite threshold form
Trudy Inst. Mat. i Mekh. UrO RAN, 28:4 (2022), 54–63
-
On maximal graphical partitions that are the nearest to a given graphical partition
Sib. Èlektron. Mat. Izv., 17 (2020), 338–363
-
Bipartite threshold graphs
Trudy Inst. Mat. i Mekh. UrO RAN, 26:2 (2020), 56–67
-
On the shortest sequences of elementary transformations in the partition lattice
Sib. Èlektron. Mat. Izv., 15 (2018), 844–852
-
On maximal graphical partitions
Sib. Èlektron. Mat. Izv., 14 (2017), 112–124
-
On threshold graphs and realizations of graphical partitions
Trudy Inst. Mat. i Mekh. UrO RAN, 23:2 (2017), 22–31
-
On the partition lattice of all integers
Sib. Èlektron. Mat. Izv., 13 (2016), 744–753
-
A new algorithm generating graphical sequences
Sib. Èlektron. Mat. Izv., 13 (2016), 269–279
-
On the partition lattice of an integer
Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015), 30–36
-
Chromatic uniqueness of elements of height $\leq3$ in lattices of complete multipartite graphs
Trudy Inst. Mat. i Mekh. UrO RAN, 17:4 (2011), 3–18
-
Chromatic uniqueness of elements of height 2 in lattices of complete multipartite graphs
Trudy Inst. Mat. i Mekh. UrO RAN, 17:3 (2011), 271–281
-
Classification of elements of small height in lattices of complete multipartite graphs
Trudy Inst. Mat. i Mekh. UrO RAN, 17:2 (2011), 159–173
© , 2024