RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Sib. Èlektron. Mat. Izv.:
Year:
Volume:
Issue:
Page:
Find






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


Sib. Èlektron. Mat. Izv., 2014, Volume 11, Pages 811–822 (Mi semr525)  

This article is cited in 2 scientific papers (total in 2 papers)

Discrete mathematics and mathematical cybernetics

The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices

D. S. Malyshevab

a Lobachevsky State University of Nizhny Novgorod, 23 Gagarina Avenue, Nizhny Novgorod, 603950, Russia
b National Research University Higher School of Economics, 25/12 Bolshaja Pecherskaja Ulitsa, Nizhny Novgorod, 603155, Russia

Abstract: We obtain a complete complexity dichotomy for the edge 3-colorability within the family of hereditary classes defined by forbidden induced subgraphs on at most 6 vertices and having at most two 6-vertex forbidden induced structures.

Keywords: computational complexity, edge 3-colorability, hereditary class, efficient algorithm.

Full text: PDF file (542 kB)
References: PDF file   HTML file
UDC: 519.178
MSC: 05C15, 05С85
Received November 30, 2013, published November 12, 2014
Language:

Citation: D. S. Malyshev, “The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices”, Sib. Èlektron. Mat. Izv., 11 (2014), 811–822

Citation in format AMSBIB
\Bibitem{Mal14}
\by D.~S.~Malyshev
\paper The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices
\jour Sib. \`Elektron. Mat. Izv.
\yr 2014
\vol 11
\pages 811--822
\mathnet{http://mi.mathnet.ru/semr525}


Linking options:
  • http://mi.mathnet.ru/eng/semr525
  • http://mi.mathnet.ru/eng/semr/v11/p811

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. D. S. Malyshev, “Complexity classification of the edge coloring problem for a family of graph classes”, Discrete Math. Appl., 27:2 (2017), 97–101  mathnet  crossref  crossref  mathscinet  isi  elib
    2. D. S. Malyshev, O. O. Lobanova, “Two complexity results for the vertex coloring problem”, Discret Appl. Math., 219 (2017), 158–166  crossref  mathscinet  zmath  isi  scopus
  • Number of views:
    This page:147
    Full text:38
    References:33

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020