Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Senchonok, Tat'yana Aleksandrovna
Statistics Math-Net.Ru
Total publications: 17
Scientific articles: 17

Number of views:
This page:734
Abstract pages:5499
Full texts:1717
References:1150
Associate professor
Candidate of physico-mathematical sciences
E-mail: ,

https://www.mathnet.ru/eng/person66357
List of publications on Google Scholar
https://elibrary.ru/author_items.asp?authorid=767296

Publications in Math-Net.Ru Citations
2024
1. V. A. Baranskii, I. A. Nasyrov, T. A. Senchonok, “$4$-graceful trees”, Trudy Inst. Mat. i Mekh. UrO RAN, 30:4 (2024),  64–76  mathnet  elib
2. Vitaly A. Baransky, Valentin V. Zuev, Tatiana A. Senchonok, “Reducing graphs by lifting rotations of edges to splittable graphs”, Ural Math. J., 10:2 (2024),  25–36  mathnet  elib
2023
3. V. A. Baranskii, T. A. Senchonok, “Bipartite-threshold graphs and lifting rotations of edges in bipartite graphs”, Trudy Inst. Mat. i Mekh. UrO RAN, 29:1 (2023),  24–35  mathnet  mathscinet  elib 2
4. Vitaly A. Baranskii, Tatiana A. Senchonok, “On sequences of elementary transformations in the integer partitions lattice”, Ural Math. J., 9:2 (2023),  36–45  mathnet  elib
5. Vitaly A. Baransky, Tatiana A. Senchonok, “Around the ErdÖs–Gallai criterion”, Ural Math. J., 9:1 (2023),  29–48  mathnet  elib 2
2022
6. V. A. Baranskii, T. A. Senchonok, “An algorithm for taking a bipartite graph to the bipartite threshold form”, Trudy Inst. Mat. i Mekh. UrO RAN, 28:4 (2022),  54–63  mathnet  mathscinet  elib 1
2020
7. V. A. Baransky, T. A. Senchonok, “On maximal graphical partitions that are the nearest to a given graphical partition”, Sib. Èlektron. Mat. Izv., 17 (2020),  338–363  mathnet 3
8. V. A. Baranskii, T. A. Senchonok, “Bipartite threshold graphs”, Trudy Inst. Mat. i Mekh. UrO RAN, 26:2 (2020),  56–67  mathnet  elib 2
2018
9. V. A. Baransky, T. A. Senchonok, “On the shortest sequences of elementary transformations in the partition lattice”, Sib. Èlektron. Mat. Izv., 15 (2018),  844–852  mathnet 5
2017
10. V. A. Baransky, T. A. Senchonok, “On maximal graphical partitions”, Sib. Èlektron. Mat. Izv., 14 (2017),  112–124  mathnet 3
11. V. A. Baranskii, T. A. Senchonok, “On threshold graphs and realizations of graphical partitions”, Trudy Inst. Mat. i Mekh. UrO RAN, 23:2 (2017),  22–31  mathnet  elib 2
2016
12. V. A. Baranskii, T. A. Koroleva, T. A. Senchonok, “On the partition lattice of all integers”, Sib. Èlektron. Mat. Izv., 13 (2016),  744–753  mathnet 7
13. V. A. Baransky, T. I. Nadymova, T. A. Senchonok, “A new algorithm generating graphical sequences”, Sib. Èlektron. Mat. Izv., 13 (2016),  269–279  mathnet 3
2015
14. V. A. Baranskii, T. A. Koroleva, T. A. Senchonok, “On the partition lattice of an integer”, Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015),  30–36  mathnet  mathscinet  elib 7
2011
15. V. A. Baranskii, T. A. Sen'chonok, “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  mathnet  elib; Proc. Steklov Inst. Math., 279, suppl. 1 (2012), S1–S16  isi  scopus 5
16. T. A. Senchonok, “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  mathnet  elib 3
17. T. A. Senchonok, V. A. Baransky, “Classification of elements of small height in lattices of complete multipartite graphs”, Trudy Inst. Mat. i Mekh. UrO RAN, 17:2 (2011),  159–173  mathnet  elib 2

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025