Abstract

A projection of the bouquet graph B with two cycles is said to be trivial if only trivial embeddings are obtained from the projection. In this paper a finite set of nontrivial embeddings of B is shown to be minimal among those which produce all nontrivial projections of B.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call