Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

The search session has expired. Please query the service again.

Currently displaying 1 – 1 of 1

Order by Relevance | Title | Year of publication

Results on $F$ -continuous graphs

Anna Draganova — 2009

Czechoslovak Mathematical Journal

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 \geq 1$ , there exists a regular graph that is not $F$ -continuous. If $F$ is 2-connected,...

Page 1

Download Results (CSV)

Advanced Search

Formula preview

Currently displaying 1 – 1 of 1

Results on F -continuous graphs

Results on $F$ -continuous graphs