Skip to main content
SpringerLink
Log in

The semi-chromatic number of a graph

  • Published:
Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

We introduce the notion of the semi-chromatic number of a graph with a nonempty number of edges. Then we prove that the difference between the semi-chromatic number and the half of the chromatic number is at most 1.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. R. Garey and D. S. Johnson, Computers and Intractability (W. H. Freeman and Co., New York, 1979).

    MATH  Google Scholar 

  2. V. A. Evstigneev and V.N. Kas’yanov, Glossary ofGraph Theory in Informatics and Programming (Nauka, Novosibirsk, 1999) [in Russian].

    Google Scholar 

  3. A. A. Zykov, Introduction to Graph Theory (Vuzovskaya Kniga, Moscow, 2004) [in Russian].

    Google Scholar 

  4. T. R. Jensen and B. Toft, Graph Coloring Problems (John Wiley & Sons, New York, 1995).

    MATH  Google Scholar 

  5. N. Robertson, D. Sanders, P. D. Seymour, and R. Thomas, “The Four-Colour Theorem,” J. Comb. Theory. Ser. B 70, 2–44 (1997).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ul. Varnenskaya 18/2, ap. 26, Odessa, 65070, Ukraine

    V. G. Vizing

Authors
  1. V. G. Vizing
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. G. Vizing.

Additional information

Original Russian Text © V.G. Vizing, 2013, published in Diskretnyi Analiz i Issledovanie Operatsii, 2013, Vol. 20, No. 1, pp. 3–11.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vizing, V.G. The semi-chromatic number of a graph. J. Appl. Ind. Math. 7, 269–274 (2013). https://doi.org/10.1134/S1990478913020178

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1990478913020178

Keywords

Search

Navigation