| Title: | Explicit homomorphisms of hexagonal graphs to one vertex deleted Petersen graph |
|---|
| Authors: | ID Šparl, Petra (Author)
ID Žerovnik, Janez (Author) |
|---|
| Files: |  http://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=68552
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FOV - Faculty of Organizational Sciences in Kranj
|
|---|
| Abstract: | Problem odločanja ali obstaja homomorfizem iz poljubnega grafa ▫$G$▫ v dani graf ▫$H$▫ je bil že večkrat proučevan in se je izkazal za zelo težkega. Hell in Nešetril sta dokazala, da je odločitveni problem NP-poln, če ▫$H$▫ ni dvodelen graf. V članku je obravnavan poseben problem, kjer je ▫$G$▫ poljuben heksagonalen graf brez trikotnikov, ▫$H$▫ pa Kneserjev graf ali njegov inducirani podgraf. Podana je esplicitna konstrukcija, ki dokazuje obstoj homomorfizma iz poljubnega heksagonalnega grafa brez trikotnikov v Petersenov graf brez ene točke. |
|---|
| Keywords: | matematika, teorija grafov, homomorfizem, H-barvanje, heksagonalen graf brez trikotnikov, mathematics, teorija grafov, homomorphism, H-coloring, triangle-free hexagonal graph |
|---|
| Year of publishing: | 2009 |
|---|
| Number of pages: | str. 391-398 |
|---|
| Numbering: | Vol. 14, no. 2 |
|---|
| PID: | 20.500.12556/DKUM-51856  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 1331-0623 |
|---|
| COBISS.SI-ID: | 15524441 |
|---|
| NUK URN: | URN:SI:UM:DK:WOPETDQH |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 1454 |
|---|
| Downloads: | 34 |
|---|
| 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. |
