Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Equitable Colorings of $l$-Corona Products of Cubic Graphs (1704.05929v1)

Published 19 Apr 2017 in cs.DM

Abstract: A graph $G$ is equitably $k$-colorable if its vertices can be partitioned into $k$ independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest integer $k$ for which such a coloring exists is known as the \emph{equitable chromatic number} of $G$ and it is denoted by $\chi_{=}(G)$. In this paper the problem of determinig the value of equitable chromatic number for multicoronas of cubic graphs $G \circl H$ is studied. The problem of ordinary coloring of multicoronas of cubic graphs is solvable in polynomial time. The complexity of equitable coloring problem is an open question for these graphs. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use at most $\chi_=(G \circ l H) + 1$ colors in the remaining cases.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Hanna FurmaƄczyk (14 papers)
  2. Marek Kubale (5 papers)
Citations (2)

Summary

We haven't generated a summary for this paper yet.