Hostname: page-component-89b8bd64d-9prln Total loading time: 0 Render date: 2026-05-05T05:13:54.675Z Has data issue: false hasContentIssue false
  • English
  • Français

Deciding Relaxed Two-Colourability: A Hardness Jump

Published online by Cambridge University Press:  01 March 2009

R. BERKE  and
T. SZABÓ
R. BERKE
Affiliation:
Institute of Theoretical Computer Science, ETH Zürich, 8092Switzerland (e-mail: berker@inf.ethz.ch, szabo@inf.ethz.ch)
T. SZABÓ
Affiliation:
Institute of Theoretical Computer Science, ETH Zürich, 8092Switzerland (e-mail: berker@inf.ethz.ch, szabo@inf.ethz.ch)
Get access Rights & Permissions [Opens in a new window]

Abstract

We study relaxations of proper two-colourings, such that the order of the induced monochromatic components in one (or both) of the colour classes is bounded by a constant. A colouring of a graph G is called (C1, C2)-relaxed if every monochromatic component induced by vertices of the first (second) colour is of order at most C1 (C2, resp.). We prove that the decision problem ‘Is there a (1, C)-relaxed colouring of a given graph G of maximum degree 3?’ exhibits a hardness jump in the component order C. In other words, there exists an integer f(3) such that the decision problem is NP-hard for every 2 ≤ C < f(3), while every graph of maximum degree 3 is (1, f(3))-relaxed colourable. We also show f(3) ≤ 22 by way of a quasilinear time algorithm, which finds a (1, 22)-relaxed colouring of any graph of maximum degree 3. Both the bound on f(3) and the running time greatly improve earlier results. We also study the symmetric version, that is, when C1 = C2, of the relaxed colouring problem and make the first steps towards establishing a similar hardness jump.

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1]Akiyama, J. and Chvátal, V. (1981) A short proof of the linear arboricity for cubic graphs. Bull. Liber. Arts Sci. NMS 2 1–3.Google Scholar
[2]Alon, N., Ding, G., Oporowski, B. and Vertigan, D. (2003) Partitioning into graphs with only small components. J. Combin. Theory Ser. B 87 231–243.CrossRefGoogle Scholar
[3]Andrews, J. A. and Jacobson, M. S. (1985) On a generalization of chromatic number. In Proc. Sixteenth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton 1985), Vol. 47, pp. 33–48.Google Scholar
[4]Berke, R. (2008) Transversals and colorings of graphs. PhD thesis, ETH Zürich.Google Scholar
[5]Berke, R. and Szabó, T. (2007) Relaxed coloring of cubic graphs. J. Combin. Theory Ser. B 97 652–668. Extended abstract in Proc. EuroComb (2005) 341–344.CrossRefGoogle Scholar
[6]Biedl, T. C., Bose, P., Demaine, E. D. and Lubiw, A. (2001) Efficient algorithms for Petersen's Matching Theorem. J. Algorithms 38 110–134.CrossRefGoogle Scholar
[7]Cowen, L. J., Cowen, R. H. and Woodall, D. R. (1986) Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency. J. Graph Theory 10 187–195.CrossRefGoogle Scholar
[8]Cowen, L., Goddard, W. and Jesurum, E. (1997) Defective coloring revisited. J. Graph Theory 24 205–219.3.0.CO;2-T>CrossRefGoogle Scholar
[9]Edwards, K. and Farr, G. (2001) Fragmentability of graphs. J. Combin. Theory Ser. B 82 30–37.CrossRefGoogle Scholar
[10]Harary, F. (1985) Conditional colorability in graphs. In Graphs and Applications (Boulder 1982), Wiley-Interscience, pp. 127–136.Google Scholar
[11]Harary, F. and Jones, K. F. (1985) Conditional colorability II: Bipartite variations. In Proc. Sundance Conference on Combinatorics and Related Topics (Sundance 1985), Vol. 50, pp. 205–218.Google Scholar
[12]Haxell, P., Szabó, T. and Tardos, G. (2003) Bounded size components: Partitions and transversals. J. Combin. Theory Ser. B 88 281–297.CrossRefGoogle Scholar
[13]Haxell, P., Pikhurko, O. and Thomason, A. (2008) Maximum acyclic and fragmented sets in regular graphs. J. Graph Theory. 57 (2)149–156.CrossRefGoogle Scholar
[14]Hochberg, R., McDiarmid, C. and Saks, M. (1995) On the bandwidth of triangulated triangles. Discrete Math. 138 261–265.CrossRefGoogle Scholar
[15]Kratochvíl, J., Savický, P. and Tuza, Z. (1993) One more occurrence of variables makes satisfiability jump from trivial to NP-complete. SIAM J. Comput. 22 203–210.CrossRefGoogle Scholar
[16]Linial, N. and Matoušek, J. Private communication.Google Scholar
[17]Linial, N. and Saks, M. (1993) Low diameter graph decompositions. Combinatorica 13 441–454.CrossRefGoogle Scholar
[18]Thomassen, C. (1999) Two-colouring the edges of a cubic graph such that each monochromatic component is a path of length at most 5. J. Combin. Theory Ser. B 75 100–109.CrossRefGoogle Scholar
[19]Tovey, C. (1984) A simplified NP-complete satisfiability problem. Discrete Appl. Math. 8 85–89.CrossRefGoogle Scholar
[20]Weaver, M. L. and West, D. B. (1994) Relaxed chromatic numbers of graphs. Graphs Combin. 10 75–93.CrossRefGoogle Scholar