Equitable total coloring of corona of cubic graphs (Q2042627): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Colour Numbers of Complete Graphs / 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 total coloring of \(C_m\square C_n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equitable total chromatic number of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the corona of two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5443776 / 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: Equitable total-coloring of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the total colouring number is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable total coloring of graphs with maximum degree 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Total Chromatic Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721926 / rank
 
Normal rank

Revision as of 05:38, 26 July 2024

scientific article
Language Label Description Also known as
English
Equitable total coloring of corona of cubic graphs
scientific article

    Statements

    Identifiers