The Thickness of Amalgamations and Cartesian Product of Graphs

• Autorzy: Yan Yang , Yichao Chen
• Języki publikacji: EN

Abstrakty

EN

The thickness of a graph is the minimum number of planar spanning subgraphs into which the graph can be decomposed. It is a measurement of the closeness to the planarity of a graph, and it also has important applications to VLSI design, but it has been known for only few graphs. We obtain the thickness of vertex-amalgamation and bar-amalgamation of graphs, the lower and upper bounds for the thickness of edge-amalgamation and 2-vertex-amalgamation of graphs, respectively. We also study the thickness of Cartesian product of graphs, and by using operations on graphs, we derive the thickness of the Cartesian product Kn □ Pm for most values of m and n.

Słowa kluczowe

EN

thickness; amalgamation; Cartesian product; genus

Kategorie tematyczne

• 05C10: Planar graphs; geometric and topological aspects of graph theory

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 3
• Strony: 561-572

Daty

wydano

2017-08-01

otrzymano

2015-06-29

poprawiono

2016-05-18

zaakceptowano

2016-05-20

online

2017-07-06

Twórcy

autor

Yan Yang

• , , , ,

autor

Yichao Chen

• , , ,

Identyfikatory

DOI

10.7151/dmgt.1942