The paw graph consists of a triangle with a pendant edge attached to one of the three vertices. We obtain a multigraph by adding exactly one repeated edge to the paw. Now, let D be a directed graph obtained by orientating the edges of that multigraph. For 12 of the 18 possibilities for D, we establish necessary and sufficient conditions on n for the existence of a [formula] design. Partial results are given for the remaining 6 possibilities for D.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.