On n-stars in colorings and orientations of graphs
Vernadsky National Library of Ukraine
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
On n-stars in colorings and orientations of graphs
|
|
| Creator |
Protasov, I.V.
|
|
| Description |
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.
|
|
| Date |
2019-06-17T11:29:56Z
2019-06-17T11:29:56Z 2016 |
|
| Type |
Article
|
|
| Identifier |
On n-stars in colorings and orientations of graphs / I.V. Protasov // Algebra and Discrete Mathematics. — 2016. — Vol. 22, № 2. — С. 301-303. — Бібліогр.: 3 назв. — англ.
1726-3255 2010 MSC:05C55. http://dspace.nbuv.gov.ua/handle/123456789/155731 |
|
| Language |
en
|
|
| Relation |
Algebra and Discrete Mathematics
|
|
| Publisher |
Інститут прикладної математики і механіки НАН України
|
|