The thickness of some complete bipartite and tripartite graphs
From MaRDI portal
(Redirected from Publication:6639490)
Recommendations
- The thickness of \(K_{1,n,n}\) and \(K_{2,n,n}\)
- scientific article; zbMATH DE number 6530324
- 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 the complete multipartite graphs and the join of graphs
- A note on the thickness of some complete bipartite graphs
Cites work
- A note on the thickness of some complete bipartite graphs
- A simulated annealing algorithm for determining the thickness of a graph
- Biplanar graphs: A survey
- Determining the thickness of graphs is NP-hard
- Décomposition de K₁₆ en trois graphes planaires
- Every planar graph with nine points has a nonplanar complement
- scientific article; zbMATH DE number 6530324 (Why is no real title available?)
- scientific article; zbMATH DE number 3536144 (Why is no real title available?)
- scientific article; zbMATH DE number 5593479 (Why is no real title available?)
- scientific article; zbMATH DE number 3195968 (Why is no real title available?)
- On the Planar Decomposition of a Complete Bipartite Graph
- Remarks on the thickness and outerthickness of a graph
- Remarks on the thickness of K_n,n,n
- Some problems in topological graph theory
- The Non-Biplanar Character of the Complete 9-Graph
- The thickness of graphs: A survey
- The Thickness of the Complete Graph
This page was built for publication: The thickness of some complete bipartite and tripartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6639490)
