Previous |  Up |  Next

Article

Keywords:
join graphs; minimally nonouterplanar; forbidden; homeomorphic; block; cut vertex
Summary:
In this paper, we present characterizations of pairs of graphs whose join graphs are 2-minimally nonouterplanar. In addition, we present a characterization of pairs of graphs whose join graphs are 2-minimally nonouterplanar in terms of forbidden subgraphs.
References:
[1] D. G. Akka, J. K. Bano: Characterization of 2-minimally nonouterplanar semientire graphs, preprint. MR 1825854
[2] F. Harary, Paul K. Stockmeyer: Planar composite graphs. An. Acad. Brasil. Ciênc. 43(2) (1971), 325–329. MR 0307957
[3] F. Harary, Wilcox: Boolean operation on graphs. Math. Scand. 20 (1967), 45–51. MR 0211900
[4] V. R. Kulli, D. G. Akka: On semientire graphs. J. Math. Phys. Sci. 14 (1980), 585–588. MR 0644066
[5] V. R. Kulli, M. H. Muddebihal: Characterization of join graphs with crossing number zero, preprint. MR 1829339
[6] V. R. Kulli, M. H. Muddebihal: Characterization of join graphs with crossing number 1, preprint.
[7] V. R. Kulli: Minimally nonouterplanar graph and its complement. J. Math. Phys. Sci. 9 (1975), 77–81. MR 0371704 | Zbl 0309.05110
[8] A. A. Jykov: On some properties of linear complexes. Mat. Sbornik 24 (1949), 63–188. (Russian) MR 0035428
Partner of
EuDML logo