On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size

From MaRDI portal
Publication:4973236

DOI10.1134/S1990478918040166zbMath1438.05105OpenAlexW2902303909WikidataQ128854192 ScholiaQ128854192MaRDI QIDQ4973236

Dmitrii V. Sirotkin, Dmitriy S. Malyshev

Publication date: 2 December 2019

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478918040166




Related Items (5)



Cites Work




This page was built for publication: On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size