On maximal graphical partitions that are the nearest to a given graphical partition

DOI10.33048/semi.2020.17.022zbMath1436.05014OpenAlexW3019485411MaRDI QIDQ2306054

Tat'yana Aleksandrovna Sen'chonok, Vitaliĭ Anatol'evich Baranskiĭ

Publication date: 20 March 2020

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2020.17.022

zbMATH Keywords

threshold graphsFerrer's diagramgraphical partitionlattice of integer partitionsmaximal graphical partition

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Related Items (1)

AROUND THE ERDÖS–GALLAI CRITERION

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lattice of partitions of a positive integer
• On the shortest sequences of elementary transformations in the partition lattice
• The lattice of integer partitions
• Dominance order and graphical partitions
• Threshold graphs and related topics
• On the partition lattice of all integers
• A new algorithm generating graphical sequences
• Seven criteria for integer sequences being graphic
• Some Properties of Graphs with Multiple Edges

This page was built for publication: On maximal graphical partitions that are the nearest to a given graphical partition