Vertex-Coloring with Defects

Defective coloring is a variant of the traditional vertex-coloring in which adjacent vertices are allowed to have the same color, as long as the induced monochromatic components have a certain structure. Due to its important applications, as for example in the bipartisation of graphs, this type of coloring has been extensively studied, mainly with respect to the size, degree, diameter, and acyclicity of the monochromatic components. We focus on defective colorings with κ colors in which the monochromatic components are acyclic and have small diameter, namely we consider (edge, κ)-colorings, in which the monochromatic components have diameter 1, and (star, κ)-colorings, in which they have diameter 2. We prove that the (edge, 3)-coloring problem remains NP-complete even for graphs with maximum vertex-degree 6, hence answering an open question posed by Cowen et al. [9], and for planar graphs with maximum vertex-degree 7, and we prove that the (star, 3)-coloring problem is NPcomplete even for planar graphs with bounded maximum vertex-degree. On the other hand, we give linear-time algorithms for testing the existence of (edge, 2)-colorings and of (star, 2)-colorings of partial 2-trees. Finally, we prove that outerpaths, a notable subclass of outerplanar graphs, always admit (star, 2)-colorings. Submitted: May 2016 Reviewed: November 2016 Revised: December 2016 Accepted: December 2016 Final: January 2017 Published: February 2017 Article type: Regular paper Communicated by: M. Kaykobad and R. Petreschi E-mail addresses: angelini@informatik.uni-tuebingen.de (P. Angelini) bekos@informatik.unituebingen.de (M. A. Bekos) felice.deluca@studenti.unipg.it (F. De Luca) walter.didimo@unipg.it (W. Didimo) mk@informatik.uni-tuebingen.de (M. Kaufmann) kobourov@cs.arizona.edu (S. Kobourov) fabrizio.montecchiani@unipg.it (F. Montecchiani) crisraft@mail.ntua.gr (C. N. Raftopoulou) roselli@dia.uniroma3.it (V. Roselli) symvonis@math.ntua.gr (A. Symvonis) 314 Angelini et al. Vertex-Coloring with Defects

[1]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[2]  L. Cowen,et al.  Defective coloring revisited , 1997 .

[3]  A. Hajnal,et al.  On decomposition of graphs , 1967 .

[4]  Thomas C. Hull,et al.  Defective List Colorings of Planar Graphs , 1997 .

[5]  J. Nesetril,et al.  Structural Properties of Sparse Graphs , 2008, Electron. Notes Discret. Math..

[6]  G. Chartrand,et al.  A generalization of the chromatic number , 1968, Mathematical Proceedings of the Cambridge Philosophical Society.

[7]  Siam J. CoMPtrr,et al.  FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME * , 2022 .

[8]  László Lovász.  On decomposition of graphs , 1966 .

[9]  Paul Dorbec,et al.  Vertex Partitions of Graphs into Cographs and Stars , 2014, J. Graph Theory.

[10]  Krzysztof Onak,et al.  An Efficient Partitioning Oracle for Bounded-Treewidth Graphs , 2011, APPROX-RANDOM.

[11]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs X: Linear Orderings , 1996, Theor. Comput. Sci..

[12]  Mehdi Behzad,et al.  Graphs and Digraphs , 1981, The Mathematical Gazette.

[13]  Georges Gonthier,et al.  Formal Proof—The Four- Color Theorem , 2008 .

[14]  Paul D. Seymour,et al.  Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[15]  Wayne Goddard,et al.  Coloring with defect , 1997, SODA '97.

[16]  Michael R. Fellows,et al.  On the Complexity of Some Colorful Problems Parameterized by Treewidth , 2007, COCOA.

[17]  Andrzej Proskurowski,et al.  Efficient vertex- and edge-coloring of outerplanar graphs , 1986 .

[18]  Gábor Tardos,et al.  Bounded size components--partitions and transversals , 2003, J. Comb. Theory, Ser. B.

[19]  Gwenaël Joret,et al.  Colouring Planar Graphs With Three Colours and No Large Monochromatic Components , 2013, Combinatorics, Probability and Computing.

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[21]  Alexander Langer,et al.  Practical algorithms for MSO model-checking on tree-decomposable graphs , 2014, Comput. Sci. Rev..

[22]  Bogdan Oporowski,et al.  On tree-partitions of graphs , 1996, Discret. Math..

[23]  David R. Wood,et al.  A Note on Tree-Partition-Width , 2006 .

[24]  David P. Dailey.  Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete , 1980, Discret. Math..

[25]  Dan Archdeacon,et al.  A note on defective colorings of graphs in surfaces , 1987, J. Graph Theory.

[26]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[27]  Giuseppe Liotta,et al.  Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time , 1999, Graph Drawing.

[28]  Douglas R. Woodall,et al.  Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency , 1986, J. Graph Theory.

[29]  Nobuji Saito,et al.  Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.

[30]  P. Pardalos,et al.  The Graph Coloring Problem: A Bibliographic Survey , 1998 .

[31]  王巍.  少女时代 COLOURFUL LIFE , 2008 .

[32]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[33]  Pieter Maritz,et al.  Francis Guthrie: A Colourful Life , 2012, The Mathematical Intelligencer.

[34]  F. Hwang,et al.  The Steiner Tree Problem , 2012 .

[35]  Noga Alon,et al.  Partitioning into graphs with only small components , 2003, J. Comb. Theory, Ser. B.

[36]  B. Mohar,et al.  Graph Minors , 2009 .