CLM's dependence relation, solitary patterns and $r$-graphs

D. V. V. Narayana, D. Mattiolo, Kalyani Gohokar +1

A connected r-regular graph, where $r\ge 3$, is an r-graph if each odd cut has at least r edges. Every r-graph is matching covered - a connected graph whose each edge participate…