Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Swartz, Eric Allen"'
Autor:
Swartz, Eric Allen
A near-polygonal graph is a graph Γ which has a set C of m-cycles for some positive integer m such that each 2-path of Γ is contained in exactly one cycle in C. If m is the girth of Γ then the graph is called polygonal. Up until now, the only exam
Externí odkaz:
http://rave.ohiolink.edu/etdc/view?acc_num=osu1243923530
