The thickness of some complete bipartite and tripartite graphs

DOI10.1007/S10255-024-1128-1MaRDI QIDQ6639490

Siwei Hu, Yi Chao Chen

Publication date: 15 November 2024

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

thicknesscomplete bipartite graphcomplete tripartite graphplanar decomposition

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Remarks on the thickness and outerthickness of a graph
• The thickness of graphs: A survey
• Biplanar graphs: A survey
• Décomposition de \(K_16\) en trois graphes planaires
• A simulated annealing algorithm for determining the thickness of a graph
• Some problems in topological graph theory
• Determining the thickness of graphs is NP-hard
• A note on the thickness of some complete bipartite graphs
• Remarks on the thickness of K_n,n,n
• The Thickness of the Complete Graph
• On the Planar Decomposition of a Complete Bipartite Graph
• The Non-Biplanar Character of the Complete 9-Graph
• Every planar graph with nine points has a nonplanar complement

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)