Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring (Q2911051): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Equitable coloring and the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type theorem on equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equitable \(\Delta\)-coloring of graphs with low average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equitable coloring of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Graphs and an Application to Optimizing Municipal Services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255998 / rank
 
Normal rank

Latest revision as of 16:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
scientific article

    Statements