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, 2022, Volume 29, Issue 1, Pages 33–45
DOI: https://doi.org/10.33048/daio.2022.29.718 (Mi da1291) 		 
On perfect colorings of paths divisible by a matching

M. A. Lisitsynaa, S. V. Avgustinovichb

a Budyonny Military Academy of the Signal Corps, 3 Tikhoretsky Avenue, 194064 St. Petersburg, Russia
b Sobolev Institute of Mathematics, 4 Koptyug Avenue, 630090 Novosibirsk, Russia
Full-text PDF (311 kB)
References:
PDF
HTML
DOI: https://doi.org/10.33048/daio.2022.29.718
Abstract: A vertex coloring of a graph $G$ is called perfect if the color structure of the neighborhood of each vertex depends only on the color of this vertex. We give a complete characterization of perfect colorings with an arbitrary number of colors of the lexicographic product of the infinite path graph and the matching. Illustr. 1, bibliogr. 18.
Keywords: perfect coloring, equitable partition, infinite path graph, matching, lexicographic product.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation FWNF-2022-0017
This research was carried out within the framework of the state contract of the Sobolev Institute of Mathematics (Project FWNF–2022–0017).
Received: 07.06.2021
Revised: 08.11.2021
Accepted: 29.11.2021
Bibliographic databases:
Document Type: Article
UDC: 519.174.7
Language: Russian
Citation: M. A. Lisitsyna, S. V. Avgustinovich, “On perfect colorings of paths divisible by a matching”, Diskretn. Anal. Issled. Oper., 29:1 (2022), 33–45
Citation in format AMSBIB
\Bibitem{LisAvg22}
\by M.~A.~Lisitsyna, S.~V.~Avgustinovich
\paper On perfect colorings of paths divisible~by~a~matching
\jour Diskretn. Anal. Issled. Oper.
\yr 2022
\vol 29
\issue 1
\pages 33--45
\mathnet{http://mi.mathnet.ru/da1291}
\crossref{https://doi.org/10.33048/daio.2022.29.718}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4412507}
Linking options:
  • https://www.mathnet.ru/eng/da1291
  • https://www.mathnet.ru/eng/da/v29/i1/p33
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		���������� ������ � ������������ ��������
    Statistics & downloads:
    Abstract page:189
    Full-text PDF :27
    References:50
    First page:10
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024