A study of the boundary graph classes for colorability problems
From MaRDI portal
Publication:5263795
DOI10.1134/S1990478913020117zbMath1324.05063MaRDI QIDQ5263795
Publication date: 17 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Related Items (5)
On integer programming with bounded determinants ⋮ The width and integer optimization on simplices with bounded minors of the constraint matrices ⋮ Vertex coloring of graphs with few obstructions ⋮ The coloring problem for classes with two small obstructions ⋮ Critical hereditary graph classes: a survey
This page was built for publication: A study of the boundary graph classes for colorability problems