Наукова електронна бібліотека
періодичних видань НАН України
періодичних видань НАН України
On n-stars in colorings and orientations of graphs
Репозиторій DSpace/Manakin
JavaScript is disabled for your browser. Some features of this site may not work without it.
On n-stars in colorings and orientations of graphs
Інший ID:
2010 MSC:05C55.
Посилання:
On n-stars in colorings and orientations of graphs / I.V. Protasov // Algebra and Discrete Mathematics. — 2016. — Vol. 22, № 2. — С. 301-303. — Бібліогр.: 3 назв. — англ.
Підтримка:
I thank Taras Banakh and Oleg Pikhurko for infosupport and discussions roundabout this note.
Дата:
2016
Переглядів:
528
Завантажень:
158
Анотація:
An n-star S in a graph G is the union of geodesic intervals I1,…,Ik with common end O such that the subgraphs I1∖{O},…,Ik∖{O} are pairwise disjoint and l(I1)+…+l(Ik)=n. If the edges of G are oriented, S is directed if each ray Ii is directed. For natural number n,r, we construct a graph G of diam(G)=n such that, for any r-coloring and orientation of E(G), there exists a directed n-star with monochrome rays of pairwise distinct colors.
