Rainbow graphs and semigroups
We give an algebraic characterization of rainbow graphs. A connected graph Γ is called rainbow if there is a vertex coloring of Γ, which is bijective on the set of neighbors of each vertex of Γ.
Saved in:
| Date: | 2012 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Видавничий дім "Академперіодика" НАН України
2012
|
| Series: | Доповіді НАН України |
| Subjects: | |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/84296 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | Rainbow graphs and semigroups / K.D. Protasova, Т.М. Provotar // Доп. НАН України. — 2012. — № 7. — С. 43-47. — Бібліогр.: 6 назв. — англ. |