Rzeczownik
A triangle-free connected graph where any two vertices have 0 or 2 common neighbors.
- Przykłady
-
Such graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every 2-path lies in a unique quadrangle.