|
|
|
|
Список литературы
|
|
| |
| 1. |
Асанов М.О., Баранский В.А., Расин В.В., Дискретная математика: графы, матроиды, алгоритмы, 2-е изд., испр. и доп., Лань, СПб., 2010, 368 с. |
| 2. |
Andrews G.E., The theory of partitions, Cambridge University Press, Cambridge, 1976, 255 pp.  |
| 3. |
Ivanyi A., Lucz L., Gombos G., Matuszka T., “Parallel enumeration of degree sequences of simple graphs”, Acta Univ. Sapientiae, Informatica, 4:2 (2012), 260–288  |
| 4. |
Tripathi A., Venugopalan S., West D.B., “A short constructive proof of the Erdos–Gallai characterization of graphic lists”, Discrete Math., 310:4 (2010), 833–834  |
| 5. |
Bisi C., Ciaselotti G., Oliverio P.A., “A natural extension of the Young partition lattice”, Advances in Geometry, 15:3 (2015), 263–280 |
| 6. |
Baransky V.A., Koroleva T.A., “The lattice of partitions of a positive integer”, Dokl. Math., 77:1 (2008), 72–75  |
| 7. |
Baransky V.A., Koroleva T.A., Senchonok T.A., “On the partition lattice of all integers”, Sib. Elect. Math. Reports, 13 (2016), 744–753 |
| 8. |
Kohnert A., “Dominance order and graphical partitions”, Elec. J. Comb., 11:4 (2004), 1–17 |
| 9. |
Erdös P., Gallai T., “Graphs with given degree of vertices”, Math. Lapok, 11 (1960), 264–274 |
| 10. |
Baransky V.A., Senchonok T.A., “On maximal graphical partitions that a the nearest to a given graphical partition”, Sib. Elect. Math. Reports, 17 (2020), 338–363 |
| 11. |
Mahadev N.V.R., Peled U.N., Threshold graphs and related topics, Ser. Annals of Discr. Math., 56, North-Holland Publishing Co., Amsterdam, 1995, 542 pp. |
| 12. |
Baransky V.A., Senchonok T.A., “On the shortest sequences of elementary transformations in the partition lattice”, Sib. Elect. Math. Reports, 15 (2018), 844–852 |
