H.J. Broersma
Planar graph coloring avoiding monochromatic subgraphs : trees and paths make it difficult
Broersma, H.J.; Fomin, F.V.; Kratochvil, J.; Woeginger, G.J.
Authors
F.V. Fomin
J. Kratochvil
G.J. Woeginger
Abstract
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detailed study of the computational complexity of this problem. We present a complete picture for the case with a single forbidden connected (induced or noninduced) subgraph. The 2-coloring problem is NP-hard if the forbidden subgraph is a tree with at least two edges, and it is polynomially solvable in all other cases. The 3-coloring problem is NP-hard if the forbidden subgraph is a path with at least one edge, and it is polynomially solvable in all other cases. We also derive results for several forbidden sets of cycles. In particular, we prove that it is NP-complete to decide if a planar graph can be 2-colored so that no cycle of length at most 5 is monochromatic.
Citation
Broersma, H., Fomin, F., Kratochvil, J., & Woeginger, G. (2006). Planar graph coloring avoiding monochromatic subgraphs : trees and paths make it difficult. Algorithmica, 44(4), 343-361. https://doi.org/10.1007/s00453-005-1176-8
Journal Article Type | Article |
---|---|
Publication Date | 2006-05 |
Deposit Date | Jul 2, 2008 |
Publicly Available Date | Jul 2, 2008 |
Journal | Algorithmica |
Print ISSN | 0178-4617 |
Electronic ISSN | 1432-0541 |
Publisher | Springer |
Peer Reviewed | Peer Reviewed |
Volume | 44 |
Issue | 4 |
Pages | 343-361 |
DOI | https://doi.org/10.1007/s00453-005-1176-8 |
Keywords | Graph partitioning, Forbidden subgraph, Computational complexity. |
Files
Accepted Journal Article
(224 Kb)
PDF
Copyright Statement
The original publication is available at http://ww.springerlink.com
You might also like
Fully decomposable split graphs
(2009)
Conference Proceeding
On hamiltonicity of P3-dominated graphs
(2009)
Journal Article
Upper bounds and algorithms for parallel knock-out numbers
(2009)
Journal Article
Complexity of conditional colorability of graphs
(2009)
Journal Article
Global connectivity and expansion : long cycles and factors in f-connected graphs
(2006)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search