A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Balanced graphs and noncovering graphs
1991
Discrete Mathematics
Pretzel, 0. and D. Youngs, Balanced graphs and noncovering graphs, Discrete Mathematics, 88 (1991) 279-287. 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
doi:10.1016/0012-365x(91)90015-t
fatcat:7czakctfvbbftigequezduzlsa