| Title: | Chromatic numbers of strong product of odd cycles |
|---|
| Authors: | ID Žerovnik, Janez (Author) |
|---|
| Files: |  http://dx.doi.org/10.1016/S1571-0653(04)00111-8
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Typology: | 1.08 - Published Scientific Conference Contribution |
|---|
| Organization: | FS - Faculty of Mechanical Engineering
|
|---|
| Abstract: | The problem of determining the chromatic numbers of the strong product of cycles is considered. A construction is given proving ▫$chi(G) = 2^p + 1$▫ for a product of ▫$p$▫ odd cycles of lengths at least ▫$2^p + 1$▫. Several consequences are discussed. In particular it is proved that the strong product of ▫$p$▫ factors has chromatic number at most ▫$2^p + 1$▫ provided that each factor admits the homomorphism to sufficiently long odd cycle ▫$C_{m_i}, ; m_i ge 2^p + 1$▫. |
|---|
| Keywords: | matematika, teorija grafov, krepki produkt grafov, kromatično število, lih cikel, minimalna neodvisna dominantna množica, mathematics, graph theory, strong product, chromatic number, odd cycle, minimal independent dominating set |
|---|
| Year of publishing: | 2002 |
|---|
| Number of pages: | str. 647-652 |
|---|
| Numbering: | Vol. 11 |
|---|
| PID: | 20.500.12556/DKUM-51509  |
|---|
| UDC: | 519.174 |
|---|
| ISSN on article: | 1571-0653 |
|---|
| COBISS.SI-ID: | 13825113 |
|---|
| NUK URN: | URN:SI:UM:DK:I6EZHDRW |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 1925 |
|---|
| Downloads: | 88 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
