Search results for: np-completeness

• Equitable coloring of corona products of graphs

  Publication

  • H. Furmańczyk
  • K. Kaliraj
  • M. Kubale
  • J. Vernold Vivin

  - Advances and Applications in Discrete Mathematics - Year 2013

  In this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.

  Full text to download in external service

• Potyczki algorytmiczne, czyli Alicja i Bogdan w różnych sytuacjach. Alicja i Bogdan w krainie czarów

  Publication

  • M. Kubale

  - Pismo PG - Year 2019

  Wprowadzono w zagadnienia NP-zupełności na przykładzie problemu Suma Podzbioru

• A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4

  Publication

  • K. Giaro
  • M. Kubale

  - Discussiones Mathematicae Graph Theory - Year 2020

  In the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...

  Full text available to download