Equitable coloring and the maximum degree (Q1337614): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/eujc.1994.1047 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041206070 / rank
 
Normal rank

Latest revision as of 19:22, 19 March 2024

scientific article
Language Label Description Also known as
English
Equitable coloring and the maximum degree
scientific article

    Statements

    Equitable coloring and the maximum degree (English)
    0 references
    0 references
    0 references
    0 references
    30 November 1994
    0 references
    The equitable \(h\)-coloring conjecture says that a connected graph \(G\) is equitable \(h(G)\)-colorable if it is different from \(K_ n\), \(C_{2n+1}\) and \(K_{2n+1,2n+1}\) for all \(n\geq 1\). This conjecture is proved for graphs \(G\) with \(h(G)\geq | G|/2\) or \(h(G)\leq 3\), where \(h(G)\) is the maximum vertex degree of \(G\).
    0 references
    0 references
    equitable \(h\)-coloring conjecture
    0 references
    connected graph
    0 references
    maximum vertex degree
    0 references
    0 references