Advanced Search

For any nontrivial connected graph $F$ and any graph $G$, the of a vertex $v$ in $G$ is the number of copies of $F$ in $G$ containing $v$. $G$ is called if and only if the $F$-degrees of any two adjacent vertices in $G$ differ by at most 1; $G$ is if the $F$-degrees of all vertices in $G$ are the same. This paper classifies all $P_4$-continuous graphs with girth greater than 3. We show that for any nontrivial connected graph $F$ other than the star $K_{1,k}$, $k\ge 1$, there exists a regular graph that is not $F$-continuous. If $F$ is 2-connected,...