Classes of subcubic planar graphs for which the independent set problem is polynomially solvable
From MaRDI portal
Publication:5263816
DOI10.1134/S199047891304008XzbMath1324.05036MaRDI QIDQ5263816
Publication date: 17 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Related Items (10)
On integer programming with bounded determinants ⋮ Independent sets in graphs without subtrees with many leaves ⋮ Boundary classes for graph problems involving non-local properties ⋮ A method of graph reduction and its applications ⋮ Independent sets in some classes of \(S_{i,j,k}\)-free graphs ⋮ Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs ⋮ Unnamed Item ⋮ Computational complexity of the vertex cover problem in the class of planar triangulations ⋮ Critical hereditary graph classes: a survey ⋮ Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs
This page was built for publication: Classes of subcubic planar graphs for which the independent set problem is polynomially solvable
