2 problems

Let $G$ be a Laman graph. A graph is triangle-connected if any two edges can be joined by a sequence of edges in which consecutive edges lie in a common triangle. A NAC-coloring is…

Symmetric Laman sufficiency conjecture. The Laman conditions, together with the corresponding additional conditions concerning the number of fixed structural components, should be…