2025-02-22T17:22:55-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-84296%22&qt=morelikethis&rows=5
2025-02-22T17:22:55-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-84296%22&qt=morelikethis&rows=5
2025-02-22T17:22:55-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-22T17:22:55-05:00 DEBUG: Deserialized SOLR response
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:
| 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!
|