A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring (Q3512604): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 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 / Wikidata QID
 
Property / Wikidata QID: Q60060517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A list analogue of equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Seymour conjecture for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The infamous upper tail / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian square-paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type graph packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable coloring and the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Graphs and an Application to Optimizing Municipal Services / rank
 
Normal rank

Latest revision as of 12:30, 28 June 2024

scientific article
Language Label Description Also known as
English
A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
scientific article

    Statements

    Identifiers