Partitions of Graphs

Chapter

Abstract

Many difficult optimization problems on graphs become tractable when restricted to some classes of graphs, usually to hereditary classes. A large part of these problems can be expressed in the vertex partitioning formalism, i.e., by partitioning of the vertex set of a given graph into subsets \({V }_{1},\ldots,\!{V }_{k}\) called colour classes, satisfying certain constraints either internally or externally, or both internally and externally. These requirements may be conveniently captured by the symmetric k-by-k matrix M. Concepts which are modeled by M-partitions fall naturally into the three types; each is represented in this work by some problem. Any minimal reducible bound for a hereditary property is in some sense the best possible partition. A number of such partitions are given. Clustering is a central optimization problem (among many others) with applications in various disciplines, e.g., computational biology, communications networks, image processing, pattern analysis [41, 53, 60, 57], and numerous other fields. Some new results on k-clustering of graphs are proved. Another type of M-partition is a matching cutset. The main known results on this subject are collected. The last part of this work is devoted to acyclic partitions of graphs where we consider important classes of graphs and their acyclic reducible bounds. For each partition type the complexity of considered problems is given. Also a number of open problems are presented.

Keywords

Colourings Partitions Hereditary properties k-clustering Domination Cut matching Complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abbas N (1995) Graph clustering: complexity, sequential and parallel algorithms. Ph.D. thesis, University of Alberta, Edmonton, CanadaGoogle Scholar
  2. 2.
    Alekseev VE, Farrugia A, Lozin VV (2004) New results on generalized graph coloring. Discrete Math Theor Comput Sci 6:215–222MATHMathSciNetGoogle Scholar
  3. 3.
    Alon N, McDiarmid C, Reed B (1991) Acyclic coloring of graphs. Random Struct Algorithm 2:277–288MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Berge C (1987) Hypergraphs. Gauthier-Villars, ParisMATHGoogle Scholar
  5. 5.
    Berger A (2001) Minimal forbidden subgraphs of reducible graph properties. Discuss Math Graph Theory 21:111–117MATHMathSciNetGoogle Scholar
  6. 6.
    Boiron P, Sopena E, Vignal L (1999) Acyclic improper colorings of graphs. J Graph Theory 32:97–107MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Boiron P, Sopena E, Vignal L (1999) Acyclic improper colourings of graphs with bounded degree. DIMACS Series Discrete Math Theor Comput Sci 49:1–9MathSciNetGoogle Scholar
  8. 8.
    Borodin OV (1979) On acyclic colorings of planar graphs. Discrete Math 25:211–236MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Borodin OV, Kostochka AV, Raspaud A, Sopena E (2001) Acyclic colourings of 1-planar graphs. Discrete Appl Math 114:29–41MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Borodin OV, Kostochka AV, Woodall DR (1999) Acyclic colorings of planar graphs with large girth. J Lond Math Soc 60:344–352CrossRefMathSciNetGoogle Scholar
  11. 11.
    Borowiecki M, Broere I, Frick M, Mihók P, Semanišin G (1997) A survey of hereditary properties of graphs. Discuss Math Graph Theory 17:5–50MATHMathSciNetGoogle Scholar
  12. 12.
    Borowiecki M, Broere I, Mihók P (2000) Minimal reducible bounds for planar graphs. Discrete Math 212:19–27MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Borowiecki M, Fiedorowicz A (2006) On partitions of hereditary properties of graphs. Discuss Math Graph Theor 26:377–387MATHMathSciNetGoogle Scholar
  14. 14.
    Borowiecki M, Fiedorowicz A, Jesse-Józefczyk K, Sidorowicz E (2010) Acyclic colourings of graphs with bounded degree. Discrete Math Theor Comput Sci 12:59–74MATHMathSciNetGoogle Scholar
  15. 15.
    Borowiecki M, Hałuszczak M, Skowrońska M (2000) Minimal reducible bounds for 1-nonouterplanar graphs. Discrete Math 219:9–15MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Borowiecki M, Jesse-Józefczyk K (2008) Matching cutsets in graphs of diameter 2. Theor Comput Sci 407:574–582MATHCrossRefGoogle Scholar
  17. 17.
    Borowiecki M, Mihók P (1991) Hereditary properties of graphs. In: Kulli VR (ed) Advances in graph theory. Vishwa International Publication, Gulbarga, pp 41–68Google Scholar
  18. 18.
    Borowiecki P (1993) \(\mathcal{P}\)-bipartitions of graphs. Vishwa Int J Graph Theory 2:109–116Google Scholar
  19. 19.
    Borowiecki P, Ivančo J (1997) \(\mathcal{P}\)-bipartitions of minor hereditary properties. Discuss Math Graph Theory 17:89–93MATHMathSciNetGoogle Scholar
  20. 20.
    Brandsta̋dt A, Le VB, Szymczak T (1998) The complexity of some problems related to GRAPH 3-COLORABILITY. Discrete Appl Math 89:59–73Google Scholar
  21. 21.
    Broere I, Mynhardt CM (1984) Generalized colorings of outerplanar and planar graphs. In: Proceedings of the fifth international conference on the theory and applications of graphs with special emphasis on algorithms and computer science. Wiley-Interscience, New York, pp 151–161Google Scholar
  22. 22.
    Brooks RL (1941) On colouring the nodes of a network. Proc Camb Philos Soc 37:194–197CrossRefMathSciNetGoogle Scholar
  23. 23.
    Brucker P (1978) On the complexity of clustering problems. In: Henn R, Korte B, Oettli W (eds) Optimization and operations research. Lecture notes in economics and mathematical systems, vol 157. Springer, New York, pp 45–54Google Scholar
  24. 24.
    Burstein MI (1979) Every 4-valent graph has an acyclic 5-coloring. Soobšč. Akad Gruzin SSR 93:21–24 (in Russian)MATHMathSciNetGoogle Scholar
  25. 25.
    Chvátal V (1984) Recognizing decomposable graphs. J Graph Theory 8:51–53MATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    Chartrand G, Kronk HV (1969) The point arboricity of planar graphs. J Lond Math Soc 44:612–616MATHCrossRefMathSciNetGoogle Scholar
  27. 27.
    Coreli DG, Fonlupt J (1993) Stable set bonding in perfect graphs and parity graphs. J Combin Theory B 59:1–14CrossRefGoogle Scholar
  28. 28.
    Dahlhaus E, Manuel P, Miller M (1998) Maximum h-colourable subgraph problem in balanced graphs. Inform Process Lett 65:301–303CrossRefMathSciNetGoogle Scholar
  29. 29.
    Deogun JS, Kratsch D, Steiner G (1997) An approximation algorithm for clustering graphs with dominating diametral path. Inform Process Lett 61:121–127CrossRefMathSciNetGoogle Scholar
  30. 30.
    Diestel R (1997) Graph theory. Springer, BerlinMATHGoogle Scholar
  31. 31.
    Faber M (1983) Characterizations of strongly chordal graphs. Discrete Math 43:173–189CrossRefMathSciNetGoogle Scholar
  32. 32.
    Farley A, Hedetniemi S, Proskurowski A (1981) Partitioning trees: matching, domination and maximum diameter. Int J Comput Inform Sci 10:55–61MATHCrossRefMathSciNetGoogle Scholar
  33. 33.
    Farrugia A (2004) Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard. Electron J Combinator 11, #R46Google Scholar
  34. 34.
    Fertin G, Raspaud A (2008) Acyclic coloring of graphs of maximum degree five: nine colors are enough. Inform Process Lett 105:65–72MATHCrossRefMathSciNetGoogle Scholar
  35. 35.
    Garey MR, Johnson DS, Stockmeyer L (1976) Some simplified NP-complete graph problems. Theor Comput Sci 1:237–267MATHCrossRefMathSciNetGoogle Scholar
  36. 36.
    Goddard W (1991) Acyclic colorings of planar graphs. Discrete Math 91:91–94MATHCrossRefMathSciNetGoogle Scholar
  37. 37.
    Grűnbaum B (1973) Acyclic coloring of planar graphs. Israel J Math 14:390–412CrossRefMathSciNetGoogle Scholar
  38. 38.
    Hakimi SL, Schmeichel E, Weinstein J (1990) Partitioning planar graphs into independent sets and forests. Congr Numer 78:109–118MATHMathSciNetGoogle Scholar
  39. 39.
    Jensen TR, Toft B (1995) Graph coloring problems. Wiley-Interscience, New YorkMATHGoogle Scholar
  40. 40.
    Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, New York, pp 85–104Google Scholar
  41. 41.
    Kershenbaum A (1993) Telecommunications network design algorithms. McGraw-Hill, New YorkGoogle Scholar
  42. 42.
    Kostochka AV (1978) Ph.D. thesis, NovosibirskGoogle Scholar
  43. 43.
    Kostochka AV, Mel’nikov LS (1976) Note to the paper of Grűnbaum on acyclic colorings. Discrete Math 14:403–406MATHCrossRefMathSciNetGoogle Scholar
  44. 44.
    Lee VB, Randerath B (2003) On stable cutsets in line graphs. Theor Comput Sci 301:463–475CrossRefGoogle Scholar
  45. 45.
    Lehel J, Tuza Zs (1986) Neighborhood perfect graphs. Discrete Math 61:93–101MATHCrossRefMathSciNetGoogle Scholar
  46. 46.
    Mahadev NVR, Peled VN (1995) Threshold graphs and related topics. Ann Discrete Math 56:170MathSciNetGoogle Scholar
  47. 47.
    Mihók P (1996) On the minimal reducible bound for outerplanar and planar graphs. Discrete Math 150:431–435MATHCrossRefMathSciNetGoogle Scholar
  48. 48.
    Mihók P (2001) Minimal reducible bounds for the class of k-degenerate graphs. Discrete Math 236:273–279MATHCrossRefMathSciNetGoogle Scholar
  49. 49.
    Moshi AM (1989) Matching cutsets in graphs. J Graph Theory 13:527–536MATHCrossRefMathSciNetGoogle Scholar
  50. 50.
    Nešetřil J, Rődl V (1976) Partitions of vertices. Comment Math Univ Carolinae 17:85–95MATHMathSciNetGoogle Scholar
  51. 51.
    Poh KS (1990) On the linear vertex-arboricity of a planar graph. J Graph Theory 14:73–75MATHCrossRefMathSciNetGoogle Scholar
  52. 52.
    Semanišin G (2004) Minimal reducible bounds for induced-hereditary properties. Discrete Math 286:163–170MATHCrossRefMathSciNetGoogle Scholar
  53. 53.
    Sharan R, Maron-Katz A, Shamir R (2003) CLICK and EXPANDER: a system for clustering and visualizing gene expression data. Bioinformatics 19:1787–1799CrossRefGoogle Scholar
  54. 54.
    Skulrattanakulchai S (2004) Acyclic colorings of subcubic graphs. Inform Process Lett 92:161–167MATHCrossRefMathSciNetGoogle Scholar
  55. 55.
    Stein SK (1971) B-sets and planar graphs. Pac J Math 37:217–224MATHGoogle Scholar
  56. 56.
    Thomassen C (1995) Decomposing a planar graph into degenerate graphs. J Combin Theory B 65:305–314MATHCrossRefMathSciNetGoogle Scholar
  57. 57.
    Tou JT, Gonzalez RC (1974) Pattern recognition principles. Addison Wesley, Reading, MAMATHGoogle Scholar
  58. 58.
    Tucker A (1983) Coloring graphs with stable cutsets. J Combin Theory B 34:258–267MATHCrossRefGoogle Scholar
  59. 59.
    West DB (2001) Introduction to graph theory, 2nd edn. Prentice Hall, Upper Saddle RiverGoogle Scholar
  60. 60.
    Wu Z, Leahy R (1993) An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE Trans Pattern Anal Mach Intell 15:1101–1113CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Faculty of Mathematics, Computer Science and EconometricsUniversity of Zielona GóraZielona GóraPoland

Personalised recommendations