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, 2010, Volume 17, Issue 6, Pages 77–95 (Mi da632)  

On perfect colorings of line graphs

D. B. Khoroshilova

Novosibirsk State University, Novosibirsk, Russia
References:
Abstract: The description of all feasible perfect colorings of line graphs, using two colors, is given, and all matrices of parameters of such colorings are listed. In addition, a simple construction that makes it possible to produce perfect colorings of arbitrary line graphs is proposed, and the perfect colorings which can be obtained with the use of the construction in question are characterized. Bibl. 13.
Keywords: perfect coloring, equitable partition, line graph.
Received: 10.10.2009
Revised: 25.07.2010
Bibliographic databases:
Document Type: Article
UDC: 519.1
Language: Russian
Citation: D. B. Khoroshilova, “On perfect colorings of line graphs”, Diskretn. Anal. Issled. Oper., 17:6 (2010), 77–95
Citation in format AMSBIB
\Bibitem{Kho10}
\by D.~B.~Khoroshilova
\paper On perfect colorings of line graphs
\jour Diskretn. Anal. Issled. Oper.
\yr 2010
\vol 17
\issue 6
\pages 77--95
\mathnet{http://mi.mathnet.ru/da632}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2797618}
\zmath{https://zbmath.org/?q=an:1249.05120}
Linking options:
  • https://www.mathnet.ru/eng/da632
  • https://www.mathnet.ru/eng/da/v17/i6/p77
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:240
    Full-text PDF :113
    References:34
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024