The thickness of amalgamations and Cartesian product of graphs
From MaRDI portal
Publication:2364079
Recommendations
Cites work
- scientific article; zbMATH DE number 3309921 (Why is no real title available?)
- scientific article; zbMATH DE number 3195968 (Why is no real title available?)
- scientific article; zbMATH DE number 3199421 (Why is no real title available?)
- A note on approximating graph genus
- A simulated annealing algorithm for determining the thickness of a graph
- Additivity of the genus of a graph
- An annotated bibliography on the thickness, outerthickness, and arboricity of a graph
- Determining the thickness of graphs is NP-hard
- Die dicke des n-dimensionalen Würfel-graphen
- Graph theory
- Multilayer grid embeddings for VLSI
- On Topological Invariants of the Product of Graphs
- On the genus and thickness of graphs
- On the thickness and arboricity of a graph
- On the thickness of graphs of given degree
- THE THICKNESS OF AN ARBITRARY COMPLETE GRAPH
- The Genera of Amalgamations of Graphs
- The Thickness of the Complete Graph
- The genus of the 2-amalgamations of graphs
- The thickness of graphs: A survey
Cited in
(5)
This page was built for publication: The thickness of amalgamations and Cartesian product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364079)