Fortæl dine venner om denne vare:
Colorability of P5-free Graphs: 4-colorability Belongs P for P5-free Graphs with a Dominating K4
Zebin Wang
Pris
DKK 494
Bestilles fra fjernlager
Forventes klar til forsendelse 3. - 11. jul.
Tilføj til din iMusic ønskeseddel
Eller
Colorability of P5-free Graphs: 4-colorability Belongs P for P5-free Graphs with a Dominating K4
Zebin Wang
This paper considers the question of whether or not a P5-free graph can be 4-colored in polynomial time. It is known that a connected P5-free graph G must have either a dominating clique or a dominating P3. Thus, when considering the 4-coloring question, we have three cases of interest: either G has a dominating K4, a dominating K3, or a dominating P3. In this paper, we demonstrate a polynomial time approach for determining whether or not a P5-free graph G with a dominating K4 can be 4-colored.
Medie | Bøger Paperback Bog (Bog med blødt omslag og limet ryg) |
Udgivet | 14. juni 2010 |
ISBN13 | 9783838373676 |
Forlag | LAP LAMBERT Academic Publishing |
Antal sider | 112 |
Mål | 225 × 7 × 150 mm · 176 g |
Sprog | Engelsk |
Se alt med Zebin Wang ( f.eks. Paperback Bog )