Talbot, John;
Yan, Jun;
(2024)
Degree Sequences of Triangular Multigraphs.
The Electronic Journal of Combinatorics
, 31
(3)
, Article P3.22. 10.37236/12518.
Preview |
Text
12518-PDF file-51071-1-10-20240831.pdf - Published Version Download (306kB) | Preview |
Abstract
A simple graph is triangular if every edge is contained in a triangle. A sequence of integers is graphical if it is the degree sequence of a simple graph. Egan and Nikolayevsky recently conjectured that every graphical sequence whose terms are all at least 4 is the degree sequence of a triangular simple graph, and proved this in some special cases. In this paper we state and prove the analogous version of this conjecture for multigraphs.
| Type: | Article |
|---|---|
| Title: | Degree Sequences of Triangular Multigraphs |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.37236/12518 |
| Publisher version: | http://dx.doi.org/10.37236/12518 |
| Language: | English |
| Additional information: | Copyright © The authors. Released under the CC BY-ND license (International 4.0), https://creativecommons.org/licenses/by-nd/4.0/deed.en. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Mathematics |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10196984 |
Archive Staff Only
 |
View Item |
