Pastāsti draugiem par šo preci:
Colorability of P5-free Graphs: 4-colorability Belongs P for P5-free Graphs with a Dominating K4 Zebin Wang
Cena
€ 45,49
Pasūtīts no attālās noliktavas
Paredzamā piegāde . gada 5. - 13. nov.
Ziemassvētku dāvanas var atgriezt līdz 31. janvārim
Saņemiet paziņojumus par jauniem Zebin Wang izdevumiem
Mūsu klienti saka:
Pievienot savam iMusic vēlmju sarakstam
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.
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2010. gada 14. jūnijs |
| ISBN13 | 9783838373676 |
| Izdevēji | LAP LAMBERT Academic Publishing |
| Lapas | 112 |
| Izmēri | 225 × 7 × 150 mm · 185 g |
| Valoda | Vācu |
Skatīt visus Zebin Wang