Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Altitude of wheels and wheel-like graphs

100%

Dzido T., Furmańczyk H.

Open Mathematics

2010

tom 8

nr 2

319-326

An edge-ordering of a graph G=(V, E) is a one-to-one mapping f:E(G)→{1, 2, ..., |E(G)|}. A path of length k in G is called a (k, f)-ascent if f increases along the successive edges forming the path. The altitude α(G) of G is the greatest integer k such that for all edge-orderings f, G has a (k, f)-ascent. In our paper we give exact values of α(G) for all helms and wheels. Furthermore, we use our result to obtain altitude for graphs that are subgraphs of helms.

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

Equitable coloring of Kneser graphs

81%

Fidytek R., Furmańczyk H., Żyliński P.

Discussiones Mathematicae Graph Theory

2009

tom 29

nr 1

119-142

The Kneser graph K(n,k) is the graph whose vertices correspond to k-element subsets of set {1,2,...,n} and two vertices are adjacent if and only if they represent disjoint subsets. In this paper we study the problem of equitable coloring of Kneser graphs, namely, we establish the equitable chromatic number for graphs K(n,2) and K(n,3). In addition, for sufficiently large n, a tight upper bound on equitable chromatic number of graph K(n,k) is given. Finally, the cases of K(2k,k) and K(2k+1,k) are discussed.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Open Mathematics

2 Furmańczyk H.

1 Dzido T.

1 Fidytek R.

1 Żyliński P.

1 2010

1 2009

Wyniki wyszukiwania

Altitude of wheels and wheel-like graphs

Equitable coloring of Kneser graphs