Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: forest

Sortuj według:

Ogranicz wyniki do:

The Turán Number of the Graph 2P5

100%

Bielak H., Kieliszek S.

Discussiones Mathematicae Graph Theory

2016

tom 36

nr 3

683-694

We give the Turán number ex (n, 2P5) for all positive integers n, improving one of the results of Bushaw and Kettle [Turán numbers of multiple paths and equibipartite forests, Combininatorics, Probability and Computing, 20 (2011) 837-853]. In particular we prove that ex (n, 2P5) = 3n−5 for n ≥ 18.

Note On The Game Colouring Number Of Powers Of Graphs

88%

Andres S. D., Theuser A.

Discussiones Mathematicae Graph Theory

2016

tom 36

nr 1

31-42

We generalize the methods of Esperet and Zhu [6] providing an upper bound for the game colouring number of squares of graphs to obtain upper bounds for the game colouring number of m-th powers of graphs, m ≥ 3, which rely on the maximum degree and the game colouring number of the underlying graph. Furthermore, we improve these bounds in case the underlying graph is a forest.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

1 Andres S. D.

1 Bielak H.

1 Kieliszek S.

1 Theuser A.

2 2016

Wyniki wyszukiwania

The Turán Number of the Graph 2P5

Note On The Game Colouring Number Of Powers Of Graphs