Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs

Hanna Furmańczyk , Marek Kubale

Abstract

n/a
Author Hanna Furmańczyk (FMPI / II)
Hanna Furmańczyk,,
- Institute of Informatics
, Marek Kubale
Marek Kubale,,
-
Journal seriesDiscrete Applied Mathematics, ISSN 0166-218X, (A 25 pkt)
Issue year2018
Vol237
Pages116-122
Publication size in sheets0.5
Keywords in Englishsemi-equitable coloring, equitable coloring, cubic graphs, subcubic graphs
DOIDOI:10.1016/j.dam.2017.12.002
URL https://doi.org/10.1016/j.dam.2017.12.002
Languageen angielski
Score (nominal)25
ScoreMinisterial score = 25.0, 24-10-2018, ArticleFromJournal
Ministerial score (2013-2016) = 25.0, 24-10-2018, ArticleFromJournal
Publication indicators WoS Impact Factor: 2016 = 0.956 (2) - 2016=0.962 (5)
Citation count*
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back