The relationship between the thickness of the complete bipartite graph K_n + 1,2n and the complete tripartite graph K₁,n,2n

DOI10.13763/J.CNKI.JHEBNU.NSE.2019.05.001MaRDI QIDQ3306541zbMATH OpenFDO

Authors Xue Dong, Yan Yang

Publication date 12 August 2020

zbMATH Keywords

thicknesscomplete bipartite graphcomplete tripartite graphplane decomposition

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• On the relationship between the thickness of some complete bipartite graphs and complete tripartite graphs
• The thickness of \(K_{1,n,n}\) and \(K_{2,n,n}\)
• The thickness of the complete multipartite graphs and the join of graphs
• scientific article; zbMATH DE number 6530324
• A note on the thickness of some complete bipartite graphs

Cited in

(7)

• On the relationship between the thickness of some complete bipartite graphs and complete tripartite graphs
• scientific article; zbMATH DE number 3841895 (Why is no real title available?)
• The thickness of some complete bipartite and tripartite graphs
• A note on the thickness of some complete bipartite graphs
• The thickness of the complete multipartite graphs and the join of graphs
• The thickness of the Cartesian product \({K_n}\square{C_m}\)
• The thickness of \(K_{1,n,n}\) and \(K_{2,n,n}\)

This page was built for publication: The relationship between the thickness of the complete bipartite graph \({K_{n + 1,2n}}\) and the complete tripartite graph \({K_{1,n,2n}}\)

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