Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (Q4971668): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1515/acsc-2016-0016 / rank
Normal rank
 
Property / cites work
 
Property / cites work: \(H\)-factors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable colorings of bounded treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable coloring of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable \(\Delta\)-coloring of 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: Equivalence of two conjectures on equitable coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable coloring of Kneser graphs / 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: Q2858945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On colouring random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The infamous upper tail / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2906271 / 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: A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring / 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: Interval vertex-coloring of a graph with forbidden colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equitable chromatic number of complete \(n\)-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equitable coloring of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable colorings of Kronecker products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable colorings of Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable colorings of planar graphs with maximum degree at least nine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable colorings of planar graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255998 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1515/ACSC-2016-0016 / rank
 
Normal rank

Latest revision as of 15:29, 30 December 2024

scientific article; zbMATH DE number 7259403
Language Label Description Also known as
English
Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
scientific article; zbMATH DE number 7259403

    Statements

    Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (English)
    0 references
    0 references
    0 references
    0 references
    12 October 2020
    0 references
    computer experiments
    0 references
    corona graph
    0 references
    equitable chromatic number
    0 references
    equitable coloring conjectures
    0 references
    NP-hardness
    0 references
    polynomial heuristics
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references