Recognition of prefractal graphs with a primer satisfying the Ore condition, provided that a contiguity of "old" edges in a path of the prefractal graph remains
The paper examines the problem of recognition of prefractal graphs. For this sort of problems inexhaustive solutions are generally unknown. A study of properties of prefractal graphs has allowed the development of an inexhaustive algorithm of recognition of prefractal graphs with n-vertex priming, satisfying the Ore condition, provided that a contiguity of "old" edges in a path of the prefractal graph remains.