A polynomial time algorithm recognizing
β
Peter Bugata; Attila Nagy; Roman VΓ‘vra
π
Article
π
1995
π
John Wiley and Sons
π
English
β 672 KB
The link of a vertex u of a graph G is the subgraph induced by all vertices adjacent to u . If all the links of G are isomorphic to a finite graph L, then G is called a realization of L, and L is called a link graph. At the Smolenice symposium of 1963, Zykov posed the problem of recognizing iink gr