The Thickness of the Complete Graph
From MaRDI portal
Cited in
(26)- Non-planar core reduction of graphs
- On the thickness and arboricity of a graph
- On the thickness of graphs of given degree
- Remarks on the thickness of a graph
- Edge-disjoint maximal planar graphs
- A tribute to Frank Harary (in honor of his 70th birthday)
- Geometric thickness in a grid
- Complete colorings of planar graphs
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Thickness of the subgroup intersection graph of a finite group
- The thickness of amalgamations and Cartesian product of graphs
- The thickness of the complete multipartite graphs and the join of graphs
- L'épaisseur du graphe complet de 46 sommets
- A simulated annealing algorithm for determining the thickness of a graph
- Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem
- The thickness of \(K_{1,n,n}\) and \(K_{2,n,n}\)
- The complexity of the empire colouring problem
- The 6-girth-thickness of the complete graph
- The thickness of the Kronecker product of graphs
- The 4-girth-thickness of the complete multipartite graph
- A note on the 4-girth-thickness of \({K_{n,n,n}}^*\)
- Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete
- The thickness of some complete bipartite and tripartite graphs
- Geometric thickness of multigraphs is \(\exists \mathbb{R}\)-complete
- Thickness of line graph of intersection graph of ideals of rings
- Planar-toroidal decomposition of \(K_{12}\)
This page was built for publication: The Thickness of the Complete Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5508786)
