The thickness of amalgamations and Cartesian product of graphs

DOI10.7151/dmgt.1942zbMath1366.05032OpenAlexW2561108617MaRDI QIDQ2364079

Yan Yang, Yi-Chao 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

zbMATH Keywords

thicknessCartesian productgenusamalgamation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An annotated bibliography on the thickness, outerthickness, and arboricity of a graph
• A note on approximating graph genus
• On the genus and thickness of graphs
• Multilayer grid embeddings for VLSI
• On the thickness and arboricity of a graph
• On the thickness of graphs of given degree
• The thickness of graphs: A survey
• A simulated annealing algorithm for determining the thickness of a graph
• The genus of the 2-amalgamations of graphs
• Determining the thickness of graphs is NP-hard
• THE THICKNESS OF AN ARBITRARY COMPLETE GRAPH
• The Thickness of the Complete Graph
• Additivity of the genus of a graph
• Die dicke des n-dimensionalen Würfel-graphen
• On Topological Invariants of the Product of Graphs
• The Genera of Amalgamations of Graphs

This page was built for publication: The thickness of amalgamations and Cartesian product of graphs