Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (Q1701101): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2017.12.002 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Equitable coloring and the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable \(\Delta\)-coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of random cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable coloring of corona products of cubic graphs is harder than ordinary coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for equitable coloring / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2017.12.002 / rank
 
Normal rank

Latest revision as of 04:39, 11 December 2024

scientific article
Language Label Description Also known as
English
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
scientific article

    Statements

    Identifiers