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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Displaying 21 – 40 of 585

Showing per page

A note on graph coloring

D. De Werra (1974)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

A remark on graph operators

Bohdan Zelinka (1999)

Mathematica Bohemica

A theorem is proved which implies affirmative answers to the problems of E. Prisner. One problem is whether there are cycles of the line graph operator L with period other than 1, the other whether there are cycles of the 4-edge graph operator 4 with period greater than 2. Then a similar theorem follows.

Currently displaying 21 – 40 of 585