Autorenfreundlich Bücher kaufen?!
Beschreibung
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.
4-colorability belongs P for P5-free graphs with a dominating K4
Details
| Verlag | LAP LAMBERT Academic Publishing |
| Ersterscheinung | 14. Juni 2010 |
| Maße | 22 cm x 15 cm x 0.8 cm |
| Gewicht | 185 Gramm |
| Format | Softcover |
| ISBN-13 | 9783838373676 |
| Seiten | 112 |
Schlagwörter
Bekannt durch
