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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q200923 / rank
Normal rank
 
Property / author
 
Property / author: Q178710 / rank
Normal rank
 
Property / author
 
Property / author: Henry A. Kierstead / rank
 
Normal rank
Property / author
 
Property / author: Alexandr V. Kostochka / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.20630 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1487816497 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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

    Identifiers