On triangular biregular degree sequences

DOI10.1016/J.DISC.2023.113778MaRDI QIDQ6184548zbMATH OpenOpenAlexFDO

Authors Benjamin Egan, Yuri Nikolayevsky

Publication date 25 January 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

graphical degree sequencetriangular graph

Mathematics Subject Classification ID

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

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.

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

Cites work

• A note on a theorem of Erdős and Gallai
• 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
• Algorithms for constructing graphs and digraphs with given valences and factors
• Degree sequences in triangle-free graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Quartic graphs with every edge in a triangle
• The theory of graphs. Translated from the 1958 French edition by Alison Doig.

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)