  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.
