A note on the thickness of some complete bipartite graphs

DOI10.26493/1855-3974.1236.4D7MaRDI QIDQ4577871zbMATH OpenOpenAlexWikidataFDO

Authors Siwei Hu, Yichao Chen

Publication date 3 August 2018

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.1236.4d7

zbMATH Keywords

planar graphthicknesscomplete bipartite graph

Mathematics Subject Classification ID

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

Recommendations

• The thickness of \(K_{1,n,n}\) and \(K_{2,n,n}\)
• The relationship between the thickness of the complete bipartite graph \({K_{n + 1,2n}}\) and the complete tripartite graph \({K_{1,n,2n}}\)
• Remarks on the thickness and outerthickness of a graph
• The thickness of the complete multipartite graphs and the join of graphs
• On the relationship between the thickness of some complete bipartite graphs and complete tripartite graphs

Cited in

(8)

• A note on fold thickness of graphs
• scientific article; zbMATH DE number 4208089 (Why is no real title available?)
• Remarks on the thickness and outerthickness of a graph
• Geometric Thickness of Complete Graphs
• On the decomposition of graphs into complete bipartite graphs
• The relationship between the thickness of the complete bipartite graph \({K_{n + 1,2n}}\) and the complete tripartite graph \({K_{1,n,2n}}\)
• The thickness of some complete bipartite and tripartite graphs
• A genetic algorithm for determining the thickness of a graph

This page was built for publication: A note on the thickness of some complete bipartite graphs

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