Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous

Haitze J. Broersma, F.V. Fomin, J. Kratochvíl, Gerhard Woeginger

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)
Original languageEnglish
Title of host publicationAlgorithm Theory — SWAT 2002
Subtitle of host publication8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings
EditorsM Penttonen, E. Meineche Schmidt
PublisherSpringer
Pages160-169
ISBN (Electronic)978-3-540-45471-7
ISBN (Print)978-3-540-43866-3
DOIs
Publication statusPublished - 2002

Publication series

NameLecture notes in computer science
Volume2368
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • METIS-208169

Cite this

Broersma, H. J., Fomin, F. V., Kratochvíl, J., & Woeginger, G. (2002). Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. In M. Penttonen, & E. Meineche Schmidt (Eds.), Algorithm Theory — SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings (pp. 160-169). (Lecture notes in computer science; Vol. 2368). Springer. https://doi.org/10.1007/3-540-45471-3_17
Broersma, Haitze J. ; Fomin, F.V. ; Kratochvíl, J. ; Woeginger, Gerhard. / Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. Algorithm Theory — SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings. editor / M Penttonen ; E. Meineche Schmidt. Springer, 2002. pp. 160-169 (Lecture notes in computer science).
@inproceedings{007387bd59934b49bda41c642342ecac,
title = "Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous",
keywords = "METIS-208169",
author = "Broersma, {Haitze J.} and F.V. Fomin and J. Kratochv{\'i}l and Gerhard Woeginger",
year = "2002",
doi = "10.1007/3-540-45471-3_17",
language = "English",
isbn = "978-3-540-43866-3",
series = "Lecture notes in computer science",
publisher = "Springer",
pages = "160--169",
editor = "M Penttonen and {Meineche Schmidt}, E.",
booktitle = "Algorithm Theory — SWAT 2002",

}

Broersma, HJ, Fomin, FV, Kratochvíl, J & Woeginger, G 2002, Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. in M Penttonen & E Meineche Schmidt (eds), Algorithm Theory — SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings. Lecture notes in computer science, vol. 2368, Springer, pp. 160-169. https://doi.org/10.1007/3-540-45471-3_17

Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. / Broersma, Haitze J.; Fomin, F.V.; Kratochvíl, J.; Woeginger, Gerhard.

Algorithm Theory — SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings. ed. / M Penttonen; E. Meineche Schmidt. Springer, 2002. p. 160-169 (Lecture notes in computer science; Vol. 2368).

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous

AU - Broersma, Haitze J.

AU - Fomin, F.V.

AU - Kratochvíl, J.

AU - Woeginger, Gerhard

PY - 2002

Y1 - 2002

KW - METIS-208169

U2 - 10.1007/3-540-45471-3_17

DO - 10.1007/3-540-45471-3_17

M3 - Conference contribution

SN - 978-3-540-43866-3

T3 - Lecture notes in computer science

SP - 160

EP - 169

BT - Algorithm Theory — SWAT 2002

A2 - Penttonen, M

A2 - Meineche Schmidt, E.

PB - Springer

ER -

Broersma HJ, Fomin FV, Kratochvíl J, Woeginger G. Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. In Penttonen M, Meineche Schmidt E, editors, Algorithm Theory — SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings. Springer. 2002. p. 160-169. (Lecture notes in computer science). https://doi.org/10.1007/3-540-45471-3_17