On triangular biregular degree sequences

DOI10.1016/J.DISC.2023.113778arXiv2303.17804OpenAlexW4388550265MaRDI QIDQ6184548FDOQ6184548

Authors: Benjamin Egan, Yuri Nikolayevsky 

Publication date: 25 January 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture for a class of biregular graphical degree sequences.

Full work available at URL: https://arxiv.org/abs/2303.17804

Recommendations

• Degree sequences of triangular multigraphs
• scientific article; zbMATH DE number 1347014
• On regular triangle-distinct graphs
• Minimal regular graphs with every edge in a triangle
• On realization graphs of degree sequences

zbMATH Keywords

triangular graphgraphical degree sequence

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)

Cites Work

• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• A note on a theorem of Erdős and Gallai
• Algorithms for constructing graphs and digraphs with given valences and factors
• The theory of graphs. Translated from the 1958 French edition by Alison Doig.
• A remark on the existence of finite graphs
• A sharp refinement of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences
• Degree sequences in triangle-free graphs
• Quartic graphs with every edge in a triangle

Cited In (2)

• On regular triangle-distinct graphs
• Degree sequences of triangular multigraphs

This page was built for publication: On triangular biregular degree sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184548)