Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2009, Volume 16, Issue 4, Pages 21–30 (Mi da577)  
Vertex colorings of graph with the majority restrictions on the consuming colors

V. G. Vizing

Odessa National Academy of Food Technology, Odessa, Ukraine
Full-text PDF (245 kB)
References:
PDF
HTML
Abstract: Vertex colorings of a graph under the condition that every vertex has the maximal feasible color are considered. The chromatical criterion for such prescription which generalizes the Vitaver theorem is given. We estimate the maximal value of the prescribed color needed for a prescription to be chromatical. The analogies of the Nordhause–Gaddum theorem on interdependence of chromatic characteristics of the graph and the complementary graph are obtained. Bibl. 7.
Keywords: majority prescription, feasible coloring, chromat of graph.
Received: 20.11.2008
Revised: 18.05.2009
English version:
Journal of Applied and Industrial Mathematics, 2010, Volume 4, Issue 2, Pages 270–275
DOI: https://doi.org/10.1134/S199047891002016X
Bibliographic databases:
UDC: 519.178
Language: Russian
Citation: V. G. Vizing, “Vertex colorings of graph with the majority restrictions on the consuming colors”, Diskretn. Anal. Issled. Oper., 16:4 (2009), 21–30; J. Appl. Industr. Math., 4:2 (2010), 270–275
Citation in format AMSBIB
\Bibitem{Viz09}
\by V.~G.~Vizing
\paper Vertex colorings of graph with the majority restrictions on the consuming colors
\jour Diskretn. Anal. Issled. Oper.
\yr 2009
\vol 16
\issue 4
\pages 21--30
\mathnet{http://mi.mathnet.ru/da577}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2589399}
\zmath{https://zbmath.org/?q=an:1249.05148}
\transl
\jour J. Appl. Industr. Math.
\yr 2010
\vol 4
\issue 2
\pages 270--275
\crossref{https://doi.org/10.1134/S199047891002016X}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77953502287}
Linking options:
  • https://www.mathnet.ru/eng/da577
  • https://www.mathnet.ru/eng/da/v16/i4/p21
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025