The thickness of amalgamations and Cartesian product of graphs
From MaRDI portal
Publication:2364079
DOI10.7151/DMGT.1942zbMATH Open1366.05032OpenAlexW2561108617MaRDI QIDQ2364079FDOQ2364079
Authors: Yan Yang, Yichao Chen
Publication date: 17 July 2017
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1942
Recommendations
Cites Work
- Graph theory
- An annotated bibliography on the thickness, outerthickness, and arboricity of a graph
- A note on approximating graph genus
- The genus of the 2-amalgamations of graphs
- Additivity of the genus of a graph
- The thickness of graphs: A survey
- The Thickness of the Complete Graph
- On Topological Invariants of the Product of Graphs
- Title not available (Why is that?)
- On the genus and thickness of graphs
- On the thickness and arboricity of a graph
- On the thickness of graphs of given degree
- Title not available (Why is that?)
- Multilayer grid embeddings for VLSI
- Determining the thickness of graphs is NP-hard
- THE THICKNESS OF AN ARBITRARY COMPLETE GRAPH
- A simulated annealing algorithm for determining the thickness of a graph
- The Genera of Amalgamations of Graphs
- Die dicke des n-dimensionalen Würfel-graphen
- Title not available (Why is that?)
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)