Characterization of \(2\)-minimally nonouterplanar join graphs

DOI10.21136/MB.2001.133919zbMATH Open0977.05112MaRDI QIDQ2760895

D. G. Akka, J. K. Bano

Publication date: 16 December 2001

Published in: Mathematica Bohemica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/32551

zbMATH Keywords

blockforbiddencut vertexjoin graphshomeomorphicminimally nonouterplanar

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• Two-dimensional disjoint minimal graphs 👍 👎
• Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs 👍 👎
• Characterization of minimally \((2,l)\)-connected graphs 👍 👎
• A characterization of the non-trivial diameter two graphs of minimum size 👍 👎
• Characterizing minimally \(n\)-extendable bipartite graphs 👍 👎
• The join of graphs and the binding minimality 👍 👎
• 2-minimally nonouterplanar semitotal-block graphs and total-block graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Characterization of \(2\)-minimally nonouterplanar join graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760895)