Characterization of join graphs with crossing number zero

MaRDI QIDQ2743888zbMATH OpenFDO

Authors M. H. Muddebihal, V. R. Kulli

Publication date 17 September 2001

Published in Far East Journal of Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

crossing numberedge-semientire graphjoin graphvertex-semientire graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Review text

The join \(G+H\) of two vertex-disjoint graphs \(G\) and \(H\) is obtained from the union of \(G\) and \(H\) by adding all edges between every vertex of \(G\) and every vertex of \(H\). The authors characterize all pairs \(G, H\) such that \(G+H\) is planar, outerplanar, and minimally nonouterplanar, respectively. The presentation of the paper is not very well. For example, the authors state some facts about an undefined term \(i(G)\) and use it in some places in their proofs, and the second sentence in the proof of Theorem 2.8 is not in the right ballpark.

Recommendations

• Characterization of 2-minimally nonouterplanar join graphs
• On the join graphs with crossing number two
• Planarity of joined graphs
• The crossing numbers of join products of paths with graphs of order four
• On the join graphs with crossing number one

Cited in

(7)

• The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle
• The crossing numbers of join of special disconnected graph on five vertices with discrete graphs
• The Join of Graphs and Crossing Numbers
• Planarity of joined graphs
• Joins of 1-planar graphs
• On the join graphs with crossing number two
• The crossing numbers of join of the special graph on six vertices with path and cycle

This page was built for publication: Characterization of join graphs with crossing number zero

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