Search
ISSN:
1855-3966
eISSN:
1855-3974
Disciplines
(Field of Science):
- computer and information sciences (Natural sciences)
- mathematics (Natural sciences)
Ministry points: Help
| Year | Points | List |
|---|---|---|
| Year 2024 | 100 | Ministry scored journals list 2024 |
| Year | Points | List |
|---|---|---|
| 2024 | 100 | Ministry scored journals list 2024 |
| 2023 | 100 | Ministry Scored Journals List |
| 2022 | 100 | Ministry Scored Journals List 2019-2022 |
| 2021 | 100 | Ministry Scored Journals List 2019-2022 |
| 2020 | 100 | Ministry Scored Journals List 2019-2022 |
| 2019 | 100 | Ministry Scored Journals List 2019-2022 |
| 2018 | 30 | A |
| 2017 | 30 | A |
| 2016 | 30 | A |
| 2015 | 30 | A |
| 2014 | 25 | A |
| 2013 | 25 | A |
Model:
Open Access
Points CiteScore:
| Year | Points |
|---|---|
| Year 2022 | 1.8 |
| Year | Points |
|---|---|
| 2022 | 1.8 |
| 2021 | 1.5 |
| 2020 | 1.3 |
| 2019 | 1.6 |
| 2018 | 1.7 |
| 2017 | 1.7 |
| 2016 | 1.5 |
| 2015 | 1.5 |
| 2014 | 1.3 |
| 2013 | 0.8 |
| 2012 | 0.5 |
| 2011 | 0.2 |
Impact Factor:
Log in to see the Impact Factor.
Papers published in journal
Filters
total: 1
Catalog Journals
Year 2016
-
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublicationA graph 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 k for which such a coloring exists is known as the equitable chromatic number of G. In this paper the problem of determinig the equitable coloring number for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas...
seen 315 times