The complexity of coloring graphs without long induced paths
We discuss the computational complexity of determining the chromatic number of graphs without long induced paths. We prove NP-completeness of deciding whether a P8-free graph is 5-colorable and of deciding whether a P12-free graph is 4-colorable. Moreover, we give a polynomial time algorithm for dec...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2001
|
| Sorozat: | Acta cybernetica
15 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12665 |
| LEADER | 01141nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12665 | ||
| 005 | 20220614132159.0 | ||
| 008 | 161015s2001 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Woeginger Gerhard J. | |
| 245 | 1 | 4 | |a The complexity of coloring graphs without long induced paths |h [elektronikus dokumentum] / |c Woeginger Gerhard J. |
| 260 | |c 2001 | ||
| 300 | |a 107-117 | ||
| 490 | 0 | |a Acta cybernetica |v 15 No. 1 | |
| 520 | 3 | |a We discuss the computational complexity of determining the chromatic number of graphs without long induced paths. We prove NP-completeness of deciding whether a P8-free graph is 5-colorable and of deciding whether a P12-free graph is 4-colorable. Moreover, we give a polynomial time algorithm for deciding whether a P5-free graph is 3-colorable. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 700 | 0 | 1 | |a Sgall Jiří |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12665/1/cybernetica_015_numb_001_107-117.pdf |z Dokumentum-elérés |