On a theorem about vertex colorings of graphs (Q579272): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(87)90243-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979074854 / rank
 
Normal rank

Latest revision as of 11:02, 30 July 2024

scientific article
Language Label Description Also known as
English
On a theorem about vertex colorings of graphs
scientific article

    Statements

    On a theorem about vertex colorings of graphs (English)
    0 references
    0 references
    1987
    0 references
    A nice and short proof is given of the following Theorem: ``Let G be a finite graph. Let \(f_ 0,f_ 1,...,f_ n\) be real-valued functions on V(G) such that for every vertex v, \(\sum_{i}f_ i(v)>d(v)\) (the degree of v). Then there exists a colouring c: V(G)\(\to \{0,1,...,n\}\) such that every vertex v is adjacent to fewer than \(f_{c(v)}(v)\) vertices with the same colour as v'', which is due to \textit{J. Lawrence} [Discr. Math. 21, 61-68 (1978; Zbl 0371.05024)] and \textit{O. V. Borodin} and \textit{A. V. Kostochka} [J. Comb. Theory, Ser. B 23, 247-250 (1977; Zbl 0336.05104)].
    0 references
    vertex-colouring
    0 references
    0 references

    Identifiers