Previous |  Up |  Next

Article

Title: Characterization of $2$-minimally nonouterplanar join graphs (English)
Author: Akka, D. G.
Author: Bano, J. K.
Language: English
Journal: Mathematica Bohemica
ISSN: 0862-7959 (print)
ISSN: 2464-7136 (online)
Volume: 126
Issue: 1
Year: 2001
Pages: 1-13
Summary lang: English
.
Category: math
.
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. (English)
Keyword: join graphs
Keyword: minimally nonouterplanar
Keyword: forbidden
Keyword: homeomorphic
Keyword: block
Keyword: cut vertex
MSC: 05C50
MSC: 05C75
MSC: 05C99
idZBL: Zbl 0977.05112
idMR: MR1825854
DOI: 10.21136/MB.2001.133919
.
Date available: 2009-09-24T21:46:42Z
Last updated: 2020-07-29
Stable URL: http://hdl.handle.net/10338.dmlcz/133919
.
Reference: [1] D. G. Akka, J. K. Bano: Characterization of 2-minimally nonouterplanar semientire graphs, preprint.. MR 1825854
Reference: [2] F. Harary, Paul K. Stockmeyer: Planar composite graphs.An. Acad. Brasil. Ciênc. 43(2) (1971), 325–329. MR 0307957
Reference: [3] F. Harary, Wilcox: Boolean operation on graphs.Math. Scand. 20 (1967), 45–51. MR 0211900
Reference: [4] V. R. Kulli, D. G. Akka: On semientire graphs.J. Math. Phys. Sci. 14 (1980), 585–588. MR 0644066
Reference: [5] V. R. Kulli, M. H. Muddebihal: Characterization of join graphs with crossing number zero, preprint.. MR 1829339
Reference: [6] V. R. Kulli, M. H. Muddebihal: Characterization of join graphs with crossing number 1, preprint..
Reference: [7] V. R. Kulli: Minimally nonouterplanar graph and its complement.J. Math. Phys. Sci. 9 (1975), 77–81. Zbl 0309.05110, MR 0371704
Reference: [8] A. A. Jykov: On some properties of linear complexes.Mat. Sbornik 24 (1949), 63–188. (Russian) MR 0035428
.

Files

Files Size Format View
MathBohem_126-2001-1_1.pdf 357.2Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo