Tell your friends about this item:
Colorability of P5-free Graphs: 4-colorability Belongs P for P5-free Graphs with a Dominating K4 Zebin Wang
Do you have a profile? Log in
Get notified about new Zebin Wang releases
Our customers say:
Add to your iMusic wish list
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.
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | June 14, 2010 |
| ISBN13 | 9783838373676 |
| Publishers | LAP LAMBERT Academic Publishing |
| Pages | 112 |
| Dimensions | 225 × 7 × 150 mm · 185 g |
| Language | German |
See all of Zebin Wang ( e.g. Paperback Book )