The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices
type: Item
instance of: scholarly article
title: The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices
zbMATH Open document ID: 1326.05047
publication date: 2015-11-18T00:00:00Z
full work available at URL: p811-822.pdf
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6510930
zbMATH Keywords: computational complexity
zbMATH Keywords: edge 3-colorability
zbMATH Keywords: hereditary class
zbMATH Keywords: efficient algorithm
author: D. S. Malyshev
MaRDI profile type: Publication
published in: Sibirskie Elektronnye Matematicheskie Izvestiya
description: scientific article; zbMATH DE number 6510930