Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: amalgamation

Sortuj według:

Ogranicz wyniki do:

The Thickness of Amalgamations and Cartesian Product of Graphs

100%

Yang Y., Chen Y.

Discussiones Mathematicae Graph Theory

2017

tom 37

nr 3

561-572

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.

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

On interpolation in NEXT(KB.Alt(2))

100%

Kostrzycka Z.

Bulletin of the Section of Logic

2018

tom 47

nr 3

We prove that there is infinitely many tabular modal logics extending KB.Alt(2) which have interpolation.

Ograniczanie wyników

1 Bulletin of the Section of Logic

1 Discussiones Mathematicae Graph Theory

1 Chen Y.

1 Kostrzycka Z.

1 Yang Y.

1 2018

1 2017

Wyniki wyszukiwania

The Thickness of Amalgamations and Cartesian Product of Graphs

On interpolation in NEXT(KB.Alt(2))