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, 2020, Volume 27, Issue 4, Pages 104–130
DOI: https://doi.org/10.33048/daio.2020.27.682 (Mi da1269) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Complete complexity dichotomy for 7-edge forbidden subgraphs in the edge coloring problem

D. S. Malyshev

National Research University “Higher School of Economics”, 25/12 Bolshaya Pechyorskaya Street, 603155 Nizhny Novgorod, Russia
Full-text PDF (463 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.33048/daio.2020.27.682
Abstract: The edge coloring problem for a graph is to minimize the number of colors that are sufficient to color all edges of the graph so that all adjacent edges receive distinct colors. The computational complexity of the problem is known for all graph classes defined by forbidden subgraphs with at most 6 edges. We improve this result and obtain a complete complexity classification of the edge coloring problem for all sets of prohibitions each of which has at most 7 edges. Illustr. 3, bibliogr. 36.
Keywords: edge coloring problem, strongly hereditary class, computational complexity.
Funding agency Grant number
Russian Science Foundation 19-71-00005
This research is supported by the Russian Science Foundation (project No. 19–71–00005).
Received: 22.01.2020
Revised: 01.06.2020
Accepted: 11.06.2020
English version:
Journal of Applied and Industrial Mathematics, 2020, Volume 14, Issue 4, Pages 706–721
DOI: https://doi.org/10.1134/S1990478920040092
Bibliographic databases:
Document Type: Article
UDC: 519.17
Language: Russian
Citation: D. S. Malyshev, “Complete complexity dichotomy for 7-edge forbidden subgraphs in the edge coloring problem”, Diskretn. Anal. Issled. Oper., 27:4 (2020), 104–130; J. Appl. Industr. Math., 14:4 (2020), 706–721
Citation in format AMSBIB
\Bibitem{Mal20}
\by D.~S.~Malyshev
\paper Complete complexity dichotomy for~7-edge~forbidden subgraphs in~the~edge~coloring~problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2020
\vol 27
\issue 4
\pages 104--130
\mathnet{http://mi.mathnet.ru/da1269}
\crossref{https://doi.org/10.33048/daio.2020.27.682}
\transl
\jour J. Appl. Industr. Math.
\yr 2020
\vol 14
\issue 4
\pages 706--721
\crossref{https://doi.org/10.1134/S1990478920040092}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85102342725}
Linking options:
  • https://www.mathnet.ru/eng/da1269
  • https://www.mathnet.ru/eng/da/v27/i4/p104
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:208
    Full-text PDF :72
    References:27
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024