On n-stars in colorings and orientations of graphs

dc.contributor.author	Protasov, I.V.
dc.date.accessioned	2019-06-17T11:29:56Z
dc.date.available	2019-06-17T11:29:56Z
dc.date.issued	2016
dc.identifier.citation	On n-stars in colorings and orientations of graphs / I.V. Protasov // Algebra and Discrete Mathematics. — 2016. — Vol. 22, № 2. — С. 301-303. — Бібліогр.: 3 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2010 MSC:05C55.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/155731
dc.description.abstract	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.	uk_UA
dc.description.sponsorship	I thank Taras Banakh and Oleg Pikhurko for infosupport and discussions roundabout this note.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	On n-stars in colorings and orientations of graphs	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA