1 paper
Benjamin Egan, Yuri Nikolayevsky
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 ha…