Abstract
Probabilistic arguments show that triangle-free noncovering graphs are very common. Nevertheless, few specific examples are known. In this paper we describe a simple method of constructing a large family of such graphs. We first construct graphs that have very restricted diagram orientations and then show that identifying certain sets of vertices in one of these graphs produces a noncovering graph.
Full Text
Published Version
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